Created
March 7, 2016 20:17
-
-
Save kenmazaika/e13ae817e133e15e87c7 to your computer and use it in GitHub Desktop.
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
def binary_search(target, list) | |
position = (list.count / 2).floor | |
mid = list[position] | |
return mid if mid == target | |
if(mid < target) | |
return binary_search(target, list.slice(position + 1, list.count/2)) | |
else | |
return binary_search(target, list.slice(0, list.count/2)) | |
end | |
end | |
puts binary_search(9, [1,2,3,4,5,6,7,8,9,10]) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Here is a recursive implementation of binary search which is based on divide and conquer