Binary search: Difference between revisions
m
→{{header|EasyLang}}
(→{{header|jq}}: gojq; bsearch) |
|||
Line 3,194:
=={{header|EasyLang}}==
<syntaxhighlight lang="text">
proc
low = 1
high = len a[]
res = 0
while low <= high and res = 0
mid = (low + high) div 2
if a[mid] > val
high = mid - 1
elif a[mid] < val
low = mid + 1
else
res = mid
.
.
.
a[] = [ 2 4 6 8 9 ]
print r
</syntaxhighlight>
|