Considering a fairly common problem - I am thinking of an integer, can you guess it in O(log n) time given that I will answer to your guesses in "high", "low" or "that's the one!" - I have come across a problem that is a slight variation that has me stumped:
I am thinking of a positive real number between 1 and N. Guess my number to within one decimal place in O(log log log N) time.
I tried solving this by trying to guess 10N instead of N but that would still not give me an O(log log log N) runtime. Any and all views on this are welcome.
Thank you