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

• A table lookup is generally faster than an addition and a shift
• Many searches will be performed on the same array
• Many searches will be performed on several arrays of the same length
• Complexity of code

Submit