Last active
December 12, 2015 06:19
-
-
Save jdjkelly/4728352 to your computer and use it in GitHub Desktop.
Binary search on sorted array of ints
This file contains hidden or 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
| binarySearch = (array, key) -> | |
| lo = 0 | |
| hi = array.length -1 | |
| while lo <= hi | |
| mid = lo + (hi - lo) /2 | |
| if(key < array[mid] | |
| hi = mid - 1 | |
| else if key > array[mid] | |
| lo = mid + 1 | |
| else | |
| mid | |
| -1 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment