Binary Search in Swift

//Binary Search Algorithm

func binarySearch ( inputSortedData: [Int], searchElement: Int ) -> Int {
    var minLeft = 0
    var maxRight = inputSortedData.count - 1
    while ( minLeft <= maxRight ) {
        let middleElement = (minLeft + maxRight) / 2
        if (searchElement == inputSortedData[middleElement]) { return middleElement + 1; }
        if (searchElement < inputSortedData[middleElement]) { maxRight = middleElement - 1 }
        if (searchElement > inputSortedData[middleElement]) { minLeft = middleElement + 1 }
    }
    return -1;
}