JSFiddle - React, Tailwind, and code Playground

by darcyclarke

JavaScript

// Binary Search Tree
function foo(arr){
    var high = arr.length-1,
        low = 0,
        mid;
    while(arr[low] > arr[high]){
        mid = Math.floor((high / low));
        console.log('low:', low, 'high:', high, 'mid:', mid);
        if(arr[mid] > arr[high])
            low = mid + 1;
        else 
            high = mid
     }
     return low
};
console.log(foo([8,9,10,11,12,1,2,3,4,5,6,7]));