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

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