Iterative and recursive implementations of binary search

binarysearch.ts

function binarySearch(numbers: number[], target: number): number {
    let low: number = 0;
    let high: number =  numbers.length - 1;
    
    while (low <= high) {
        let mid = Math.floor((low + high) / 2);
        if (target < numbers[mid]) {
            high = mid - 1;
        } else if (target > numbers[mid]) {
            low = mid + 1;
        } else {
            return mid;
        }
    }
    return -1;
}

function binarySearchRecursive(numbers: number[], target: number, low: number, high: number): number {
    let mid = Math.floor((low + high) / 2);
    if (low > high) return -1; 
    
    if (target < numbers[mid]) {
        return binarySearchRecursive(numbers, target, low, mid - 1);
    } else if (target > numbers[mid]) {
        return binarySearchRecursive(numbers, target, mid + 1, high)
    } else {
        return mid;
    }
}