Fibonacci Recursion and Iteration

public static int fibonacciIteration(int n) { int i, prev, curr, temp; if(n <= 2) { return 1; } else { prev = 1; curr = 1; i = n; do { temp = prev + curr; prev = curr; curr = temp; i--; } while (i > 2); return curr; // curr holds the value we want } } public static int fibonacciRecurion(int n) { if(n <= 2) { return 1; } else { return fibonacciRecurion(n - 1) + fibonacciRecurion(n - 2); } }