36
Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 7, 8, 11, 19, 20, 23, 29, 31, 35, 43], how many comparisons with array elements are needed to find 29?
DiscussMedium
Loading subject content…
Loading subject content…
Loading practice questions…
Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 7, 8, 11, 19, 20, 23, 29, 31, 35, 43], how many comparisons with array elements are needed to find 29?