Question: Design an algorithm that guesses the correct number in a guessing game (1--n) without guessing too high twice and uses f(n) guesses such that as

Design an algorithm that guesses the correct number in a guessing game (1--n) without guessing too high twice and uses f(n) guesses such that as n gets large, f(n)/n =0. In other words, the algorithm should be O(n^x) for some x<1. Explain this algorithm in words and use concrete examples.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!