Binary Search Challenge

    function binarySearch(data, search) {
        // console.log("data", data);

        var mid = Math.floor(data.length / 2);
        // console.log('mid', mid)

        if (data[mid] === search) {
            // see if mid is what we're looking for
            return data[mid];
        } else if (data.length === 1) {
            // only one element and does not match
            return undefined;
        } else if (search < data[mid]) {
            return binarySearch(data.slice(0, mid), search)
        } else if (search > data[mid]) {
            return binarySearch(data.slice(mid, data.length), search)
        } else {
            return undefined;
        }
    }

    var data = [0,1,2,3,4,5,6,8,9];

    console.log('using data', data);
    console.log('find 0', binarySearch(data, 0));
    console.log('find 9', binarySearch(data, 9));
    console.log('find 10', binarySearch(data, 10));
    console.log('find -1', binarySearch(data, -1));
    console.log('find 3', binarySearch(data, 3));
    console.log('find 4', binarySearch(data, 4));
    console.log('find 7', binarySearch(data, 7));