Binary Search

gistfile1.txt

var newArr = [1, 2, 3, 4, 5, 6];

function binarySearch(searchElement) {
    var minIndex = 0;
    var maxIndex = this.length - 1;
    var currentIndex;
    var currentElement;

    while (minIndex <= maxIndex) {
        currentIndex = Math.round((minIndex + maxIndex) / 2);
        currentElement = this[currentIndex];

     
        if (currentElement < searchElement) {
            minIndex = currentIndex + 1;
        } else if (currentElement > searchElement) {
            maxIndex = currentIndex - 1;
        } else {
            return currentIndex;
        }
    }
    
    return ('not found');
}

binarySearch.call(newArr, 2);