Greetings ladies and gentlemen. I am right now working on a recursive formula whose nature I'll define later. Unfortunately, I have no formal education in math. What I want is some references to where I can find how to calculate the efficiency of a recursive formula and how to prove its efficiency. For example (though this is not the formula I'm working with), consider the algorithm to find the square root of a number: Step 1: Divide x2 by any number. Step 2: Take the arithmetic mean of the output number and the original input number and divide x2 by this arithmetic mean. Repeat step 2 until the output differs by its corresponding input by zero at D decimal places, where D is the number of decimal places that fits on some calculating device. How is the efficiency of the above recursive formula defined and calculated? How is the efficiency of any recursive formula defined and calculated?