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?
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.
No explanations have been posted yet. Check back later!