15
Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 7, 11, 15, 19, 23, 27, 32, 35, 39, 41, 47, 51], how many comparisons with array elements are needed to find 19?
Medium
Back to Searching
Discussion (0)
- No discussion yet. Ask a doubt or share a shortcut.
Log in to join the discussion.