It is a binary search algorithm called root of a number. The hint I gave in the mock interview as an interviewer is to explain how many numbers to search for x = 8, n = 3, it is from 0, incremented by 0.001 to 8, total is 8000 numbers to search.
Binary search algorithm
Here is the binary search algorithm I reviewed written by the peer. The algorithm still has issues to pass a few test cases. I like to look into as well.
I like to get organized and review all my past practice.
Actually the code should be updated in two places:
1. Line 44 and 45, return (double) m/ 1000;
2. Line 56, return (double) s/ 1000;
The argument is that when s == e on line 37, the return value should be s, not -1 or 0.0.
It is better to change the design, and use 0.0001 as a different number to apply binary search. Here is C# code.
Given the example x = 8, n = 3, instead of search 8000 numbers, we choose to search 80,000 using binary search. Incremental value is 0.0001 instead of 0.001.
Being an interviewer, it takes some time to figure out how to guide the peer to lead the optimal solution and pass all test cases.