Difference between revisions of "TADM2E 4.33"
From Algorithm Wiki
(Recovering wiki) |
m (Matt moved page Algorithm Wiki:TADM2E 4.33 to TADM2E 4.33 over redirect: revert) |
| (3 intermediate revisions by 3 users not shown) | |
(No difference)
| |
Latest revision as of 12:02, 2 August 2020
Apply binary search to find out transition point
Assume set indexes are zero based
FindIndex(A):
1. low = 0, high =1
2. mid = (low + high)/2
3. if(A[mid] > mid) then
Index will lie in left half of the array
high = mid-1
Go to step 2.
else if (A[mid] < mid) then
Index will lie in right half of array
low = mid + 1
else
return mid
--Max 07:31, 25 June 2010 (EDT)
