Binary search: Difference between revisions

m
Line 1,641:
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:
endif
 
if value > list[middle] then
 
let low = middle + 1
let flag = 0
 
endif
 
if flag = 1 then
Line 1,662:
let search = 0
 
endif
 
endif
305

edits