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

PYQ Capgemini Hiring Assessment 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 233 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…