The worst-case time complexity of binary search matches with −
Capgemini · 2024
The worst-case time complexity of binary search matches with −
- A.
interpolation search
- B.
linear search
- C.
merge sort
- D.
none of the above
Attempted by 227 students.
Sign up free to check your answer
Sign up freeLoading lesson…