Binary Search using Recurssion

BinarySearch.swift

/// Performs binary search using Recursion
func binarySearch<T:Comparable>(on array: [T], for targetValue: T, from minIndex: Int, to maxIndex: Int) -> Int? {
    // assigning to var so that values can be updated
    var min = minIndex
    var max = maxIndex
    // Obtaining the pivot element
    let guessIndex = Int((max + min) / 2)
    // Value comparisons
    if array[guessIndex] == targetValue {
        // Value found :) Return the index!
        return guessIndex
    } else {
        // Value not found :( Update min or max index
        if targetValue > array[guessIndex] {
            // Value lies in upper half, hence update the min
            min = guessIndex + 1
        } else {
            // targetValue < array[guess]
            // Value lies in lower half, hence update the max
            max = guessIndex - 1
        }
        if max >= min {
            // Complete array still not parsed
            return binarySearch(on: array, for: targetValue, from: min, to: max)
        } else {
            // Complete array parsed, value not found, return -1
            return nil
        }
    }
}