Binary search implementation.txt

Binary search implementation

Итеративный подход

function binarySearch (array, element) {
    let start = 0
    let end = array.length
    let middle
    let found = false
    let position = -1
    
    while (found === false && start <= end) {        
        middle = Math.floor((start + end) / 2)
        
        if (array[middle] === element) {
            found = true
            position = middle

            return position
        }
        
        if(element < array[middle]) {
            end = middle - 1
        } else {
            start = middle + 1
        }
    }
}

Рекурсивный подход

function recursiveBinarySearch (array, element, start, end) {
    let middle = Math.floor((start + end) / 2)

    if (element === array[middle]) {
        return middle
    }

    if (element < array[middle]) {
        return recursiveBinarySearch(array, element, 0, middle - 1)
    } else {
        return recursiveBinarySearch(array, element, middle + 1, end)
    }
}