Compare the performance of Ternary Search and Binary Search. Is Ternary Search always better because it divides the array into three parts?
Python interview question for Advanced practice.
Answer
No, Ternary Search is not necessarily better. While it reduces the number of iterations by dividing the range into three, it performs more comparisons (at least two) per iteration compared to Binary Search (one or two). In most computational environments, the constant factor in Binary Search's O(log2 n) is smaller than the constant factor in Ternary Search's O(log3 n).
Explanation
Ternary Search is often used to find the maximum or minimum of a unimodal function.