Multiplicative binary search: Difference between revisions

Content deleted Content added
m clean up, typo(s) fixed: mid-point → midpoint using AWB
Line 26:
# if ''i'' ≥ ''n'', the search terminates unsuccessful.
# 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 21.
# if A<sub>''i''</sub> > ''T'', set ''i'' to 2×''i'' + 2 and go to step 2.