3
Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 7, 8, 11, 14, 17, 20, 26, 29, 31, 35, 38, 41, 43, 50, 53, 56, 59, 63], how many comparisons with array elements are needed to find 41?
Medium
Back to Searching
Discussion (0)
- No discussion yet. Ask a doubt or share a shortcut.
Log in to join the discussion.