lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update 01_binary_search.lua

Browse Source
This commit is contained in:
zhangjiong
2017-08-09 17:24:00 +08:00
committed by Aditya Bhargava
parent 525ff6c314
commit e3016960ee
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
01_introduction_to_algorithms/lua/01_binary_search.lua
View File

@@ -1,10 +1,10 @@
function binary_search(table, value)
function binary_search(array, value)
-- Lua arrays start with 1
local low, high = 1, #table
local low, high = 1, #array
while low <= high do
local mid = math.floor((low + high) / 2)
local guess = table[mid]
local guess = array[mid]
if guess == value then
return mid
@@ -18,7 +18,7 @@ function binary_search(table, value)
return nil
end
local my_table = {1, 3, 5, 7, 9}
local my_array = {1, 3, 5, 7, 9}
print(binary_search(my_table, 3)) -- => 2
print(binary_search(my_table, -1)) -- => nil
print(binary_search(my_array, 3)) -- => 2
print(binary_search(my_array, -1)) -- => nil