Binary search: Difference between revisions
Content added Content deleted
No edit summary |
|||
Line 3,239:
fun recurse = int by int low, int high
if high < low do return -1 end
return when(values[mid] > value,
recurse(low, mid - 1),
Line 3,253:
int high = values.length - 1
while low <= high
if values[mid] > value do high = mid - 1
else if values[mid] < value do low = mid + 1
|