Recursive vs. Iterative

Here are two famous recursive algorithms that are implemented with iterative algorithmFactorial

 //Find n! using a recursive algorithm int FactorialRecursive(int n) {   int retVal = 1;    if( n < retval =" n" retval =" 1;" numcounter =" 1;">

Fibonacci

 //Fibonacci in recursive f(n) = f(n-1) + f(n-2) //Not a good solution, it doubles the stack size //each time is performs one operation int FibonacciRecursive(int n) {   if(n < n ="="" n ="="" n ="="" n ="="" iminus2sum =" 1;" iminus1sum =" 1;" isum =" 0;" iiterator =" 1;" isum =" iMinus2Sum" iminus2sum =" iMinus1Sum;" iminus1sum =" iSum;">