| function binarySearch(arr,value){ | |
| let left = 0; | |
| let right = arr.length - 1; | |
| let middle = Math.floor((right + left) / 2); | |
| while(left <= right) { | |
| if (arr[middle] === value) return middle | |
| if(value < arr[middle]){ | |
| right = middle - 1; | |
| } else { | |
| left = middle + 1; | |
| } | |
| middle = Math.floor((right+left)/2) | |
| } | |
| return -1; | |
| } | |
| // binarySearch([1,2,3,4,5],3) | |
| binarySearch([3],3) |