16
Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [2, 5, 8, 14, 15, 17, 20, 23, 29, 32, 35, 47], how many comparisons with array elements are needed to find 15?
Medium
Back to Searching
Discussion (0)
- No discussion yet. Ask a doubt or share a shortcut.
Log in to join the discussion.