In which of the cases uniform binary search fails compared to binary search?

PYQ Tech Mahindra Hiring Assessment 2025

In which of the cases uniform binary search fails compared to binary search?

  1. A.

    A table lookup is generally faster than an addition and a shift

  2. B.

    Many searches will be performed on the same array

  3. C.

    Many searches will be performed on several arrays of the same length

  4. D.

    Complexity of code

Attempted by 55 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…