fork download
copy 
  1. // GOOD ✅ O (log n)
  2. function binarySearch(arr, value, left, right) {
  3.     while (left <= right) {
  4.         let mid = Math.floor((left + right) / 2);
  5.         if (arr[mid] === value) return mid;
  6.         if (arr[mid] < value) left = mid + 1;
  7.         else right = mid - 1;
  8.     }
  9.     return -1;
  10. }
  11. const sortedArray = [1, 3, 5, 7, 9, 11, 13];
  12. console.log(binarySearch(sortedArray, 7, 0, sortedArray.length - 1)); // Output: 3
  13.  
Success #stdin #stdout 0.05s 18196KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
3
https://ideone.com/ByX8fW
language:
JavaScript (SMonkey 60.2.3)
created:
10 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!