Ternary Search

Computer Science Level 3

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?

O ( lg ⁡ ( n ) ) O(\lg(n)) O ( n 1 3 ) O(n^{\frac{1}{3}}) O ( lg ⁡ ( log ⁡ 3 ( n ) ) O( \lg( \log_3( n ) ) O ( lg ⁡ ( n 3 + 3 n ) ) O(\lg(\ n^3 + 3^n))

View wiki
Thaddeus Abiy by Thaddeus Abiy , 25, Ethiopia

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...