Skip to content

Instantly share code, notes, and snippets.

@andrewsouthard1

andrewsouthard1/binary_search.rb

Created May 10, 2017 17:30
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save andrewsouthard1/6f0c198d7e87f746a37eb27ed6dbae29 to your computer and use it in GitHub Desktop.
Save andrewsouthard1/6f0c198d7e87f746a37eb27ed6dbae29 to your computer and use it in GitHub Desktop.
Download ZIP
Binary Search - Before Comments
Raw
binary_search.rb
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
j = middle
middle = i + j / 2
end
end
false
end
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment