fork(1) download
  1. var doSearch = function(array, targetValue) {
  2. var min = 0;
  3. var max = array.length - 1;
  4. var guess;
  5. while(max >= min){
  6. guess = (max+min)/2;
  7. print(guess);
  8. guess = Math.floor(guess);
  9. //guess = guess | 0;
  10. if(array[guess] === targetValue){return guess;}
  11. else if(array[guess]<targetValue){min = guess + 1;}
  12. else{max=guess-1;}
  13. }
  14. return -1;
  15. };
  16.  
  17. var primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37,
  18. 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97];
  19.  
  20. var result = doSearch(primes, 73);
  21. print("Found prime at index " + result);
  22.  
  23.  
Success #stdin #stdout 0.01s 30152KB
stdin
Standard input is empty
stdout
12
18.5
21.5
19.5
20
Found prime at index 20