Binary search: Difference between revisions

Line 1,614:
<syntaxhighlight lang="basic">'iterative binary search example
 
define size = 100, search = 0, flag = 0, value = 0
define middle = 0, low = 0, high = 0
 
dim list[2, 3, 5, 6, 8, 10, 11, 15, 19, 20]
 
arraysize size, list
 
let value = 4
Line 1,641 ⟶ 1,643:
if low <= high then
 
let middle = int: ( (high + low ) / 2)
let flag = 1
 
if value < list[middle] then
 
let high = middle - 1
Line 1,651 ⟶ 1,653:
endif
 
if value > list[middle] then
 
let low = middle + 1
let flag = 0
 
endif
 
if flag = 1 then
Line 1,662 ⟶ 1,664:
let search = 0
 
endif
 
endif
305

edits