The worst-case time complexity of binary search matches with −

Capgemini · 2024

The worst-case time complexity of binary search matches with −

  1. A.

    interpolation search

  2. B.

    linear search

  3. C.

    merge sort

  4. D.

    none of the above

Attempted by 227 students.

Sign up free to check your answer

Sign up free

Explore the full course: Accenture Preparation

Loading lesson…