Ternary Search

Suppose that we modify binary search such that it splits the input not into two sets of almost-equal sizes, but into three sets of sizes approximately one-third. Which of the following describes the tightest asymptotic complexity of this algorithm?

×

Problem Loading...

Note Loading...

Set Loading...