Last active
May 10, 2017 18:22
-
-
Save andrewsouthard1/0559badbfdcbc25c79499dd4be84995a to your computer and use it in GitHub Desktop.
Binary Search - After Comments
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
def binary_search(n, arr) | |
middle = arr[arr.length / 2] | |
i = 0 | |
j = arr.length - 1 | |
while i < j | |
if middle == n | |
return true | |
elsif middle < n | |
i = middle | |
middle = i + j / 2 | |
else | |
p "Middle is greater than n" | |
j = middle | |
p "j: #{j}" | |
middle = i + j / 2 | |
p "middle: #{middle}" | |
end | |
end | |
false | |
end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment