Binary Search

BinarySearch.swift

let arrOne = [1, 2, 3, 4, 5, 6]

func binarySearch(_ inputArray: [Int], element: Int) -> Int? {
    
    var begin = 0
    var end = inputArray.count
    
    while begin < end {
        let mid = begin + (end - begin) / 2
        
        if inputArray[mid] == element {
            return mid
        } else if inputArray[mid] < element {
            begin = mid
        } else {
            end = mid
        }
        
    }
    
    return nil
}

binarySearch([1, 2, 3, 4, 5], element: 2)