Skip to content

Instantly share code, notes, and snippets.

@escray
Created November 9, 2017 07:45
Show Gist options
  • Save escray/b92bb2dba46873eb2b7f3acbcf69a42a to your computer and use it in GitHub Desktop.
Save escray/b92bb2dba46873eb2b7f3acbcf69a42a to your computer and use it in GitHub Desktop.
binary search
def binary_search(arr, element)
arr.sort!
i = 0
j = arr.length - 1
puts binary(arr, i, j, element)
end
def binary(arr, i, j, element)
mid = (i + j) / 2
if element < arr[mid]
return binary(arr, i, mid - 1, element)
elsif element > arr[mid]
return binary(arr, mid + 1, j, element)
else
return mid
end
end
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment