Include the factorial function shown in the first part of the problem so you confirm that you've got the recursion thing down. Make sure you have it running. Once you have it running, comment it out, but leave it in the file. That way, it'll be there for reference, but won't execute when your run the square root calculator below.

There are a number of neat ways to calculate the square root of a number without the square root function. An ancient method known to the Babylonians is this recursive method:

Let $N$ be the number whose square root is to be computed. Guess that some integer $n_0$ is the