// 0
func example(str: String, isAction: Bool = true, action: () -> Void) {
    print("---------\(str), isAction: \(isAction)---------")
    
    if isAction {
        action()
    }
}

// 1
/*
 Time Complexity O(n)
 */
func linearSearch<T: Equatable>(target: T, in collection: [T]) -> T? {
    
    for item in collection {
        if item == target {
            return item
        }
    }
    return nil
}

example(str: "linearSEarch") {
    var n = [23,35,23,346,457,3,36,2365]
    print(linearSearch(target: 36, in: n))
}

/*
 Time complexity O(log n)
 */
func binarySearch<T: Comparable>(target: T, in collection:[T]) -> T? {
    
    var data = collection.sorted()
    // BinarySearch는 collection이 Sort되어있어야함!
    print(data)
    
    var startIndex: Int = 0
    var endIndex: Int = data.count-1
    while startIndex <= endIndex {
        var midIndex: Int = (startIndex + endIndex) / 2
        if data[midIndex] == target {
            return target
        }else if data[midIndex] < target {
            startIndex = midIndex + 1
        }else if data[midIndex] > target {
            endIndex = midIndex - 1
        }
    }
    return nil
}

example(str: "BinarySearch") {
    var n = [23,35,23,346,457,3,36,2365]
    print(binarySearch(target: 23, in: n))
    
}