Binary search algorithm

binary-search.js

const arr = ['a','b', 'c', 'd','x', 'y', 'z'];

function findMe(target, start, end) {
    if (start > end) return 'not found';

    const middle = Math.floor((start+end)/2);

    if (arr[middle] === target) {
        return `found it at index ${middle}`;        
    }

    if (arr[middle] > target) {
        return findMe(target, start, middle-1);
    }

    if (arr[middle] < target) {
        return findMe(target, middle+1, end);
    }
}

findMe('c', 0, arr.length);

// found it at index 2

Code based on fireship video to know more about it. -> https://www.youtube.com/watch?v=MFhxShGxHWc