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