Created
June 12, 2019 09:05
-
-
Save kalyco/b5f215094fb7759bac51df21313386fd to your computer and use it in GitHub Desktop.
Binary Search
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Returns either the index of the location in the array, | |
or -1 if the array did not contain the targetValue */ | |
var doSearch = function(array, targetValue) { | |
var min = 0; | |
var max = array.length - 1; | |
var guess; | |
var guessCount = 0; | |
while (max >= min) { | |
guessCount ++; | |
guess = Math.floor((min + max)/2); | |
println(guess); | |
if (array[guess] === targetValue) { | |
println(guessCount); | |
return guess; | |
} | |
if (array[guess] < targetValue) { | |
min = (guess + 1); | |
} else { | |
max = (guess - 1); | |
} | |
} | |
return -1; | |
}; | |
var primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, | |
41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]; | |
var result = doSearch(primes, 73); | |
println("Found prime at index " + result); | |
Program.assertEqual(doSearch(primes, 73), 20); | |
Program.assertEqual(doSearch(primes, 61), 17); | |
Program.assertEqual(doSearch(primes, 13), 5); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment