fork download
  1. // your code goes here
  2. function binarySearch(arr, n, target) {
  3. let left=0, right=n-1, mid;
  4. while(left<=right) {
  5. mid = Math.floor((left+right)/2);
  6. if(arr[mid] == target) {
  7. return mid;
  8. } else if(arr[mid]<target) {
  9. left = mid+1;
  10. } else if(arr[mid]>target) {
  11. right = mid-1;
  12. }
  13. }
  14. return -1;
  15. }
  16.  
  17. console.log(binarySearch([2, 5, 7, 9, 11, 13], 6, 10))
Success #stdin #stdout 0.02s 16620KB
stdin
Standard input is empty
stdout
-1