This project calculates the nth root of a number. When prompted, enter a value for X (positive or negative, integer or float) then enter a value for n (an integer and must be an odd number if X is negative).
The algorithm is a trial and error method using a "binary" search (cutting the search range in half each time). Crude but simple! I narrow down the search range each pass (in the direction indicated by whether the result is high or low) until the error is less than 0.00001, then quit.
