Searching Algorithms Questions
The time complexity of ternary search is O(log3 n), where n is the size of the input array.