Multiplicative binary search: Difference between revisions

Content deleted Content added
a few grammar error corrections.
m Fixed leq, geq operator order
 
Line 30:
# if ''i'' ≥ ''n'', the search terminates unsuccessfully.
# if A<sub>''i''</sub> = ''T'', the search is done; return ''i''.
# if A<sub>''i''</sub> <> ''T'', set ''i'' to 2×''i'' + 1 and go to step 2.
# if A<sub>''i''</sub> >< ''T'', set ''i'' to 2×''i'' + 2 and go to step 2.
 
== See also ==