#include #include using namespace std; int r = 10; int A(int m, int n, bool isLoop = false) { if (isLoop) { // recursive if (m == 0) return n+1; if (m > 0 && n == 0) return A(m-1, 1); if (m > 0 && n > 0) return A(m-1, A(m, n-1)); } else { // loop while (m > 0) { int tm = m, tn = n; if (n == 0) m--, n = 1; else if (n > 0) m--, n = A(tm, tn-1); } return n + 1; } return 0; } int F(int n, bool isLoop = false) { if (isLoop==false) // recursive return (n <= 1) ? 1 : n * F(n-1); else { // loop int prod = 1; for (int i = n; i != 0; i--) prod *= i; return prod; } } int Fi(int n, bool isLoop = false) { if(isLoop==false) // recursive return (n<=1) ? n : Fi(n-1) + Fi(n-2); else { // loop int f1 = 0, f2 = 1, f = 0; (n == 0) ? f = f1 : f = f2; for (int i = 2; i <= n; i++) f = f1+f2, f1 = f2, f2 = f; return f; } } int Q(int n, bool isLoop = false) { if (isLoop==false) // recursive return (n<=2) ? 1 : Q(n-Q(n-1)) + Q(n-Q(n-2)); else { // loop int hof[20]; hof[0] = 1, hof[1] = 1; for (size_t i = 3; i < sizeof(hof) / sizeof(*hof); i++) hof[i-1] = hof[i-1-hof[i-2]] + hof[i-1-hof[i-3]]; return hof[n-1]; } } bool P(int n, int d, bool isLoop = false) { if(isLoop==false) // recursive return (d==1) ? 1 : ((n%d==0)?0:P(n, d-1)); else { // loop for (int i = 2; i <= n / 2; i++) if (n%i==0) return false; return true; } } int main() { cout << "\nAckermann Algorithm:"; for (int i = 0; i <= r/5; i++) for (int j = 0; j <= r/2; j++) cout << "\nA(" << i << "," << j << ") " << setw(3) << A(i, j) << setw(4) << A(i, j, true); cout << "\n\nFactorial Algorithm:"; for (int i = 0; i < r; i++) cout << "\nF(" << i << ") " << setw(7) << F(i) << setw(7) << F(i, true); cout << "\n\nFibonacci Numbers:"; for (int i = 0; i < r; i++) cout << "\nFi(" << i << ") " << setw(4) << Fi(i) << setw(4) << Fi(i, true); cout << "\n\nHofstadter's Q-Sequence:"; for (int i = 1; i <= r; i++) cout << "\nQ(" << setw(2) << i << ") " << setw(5) << Q(i) << setw(5) << Q(i, true); int range = 0; cout << "\n\nPrime Number List:\n"; for (int i = 2;; i++) { if (range == r) break; if (P(i, i/2)==true) { // recursion range++; cout << setw(2) << range << ": " << setw(4) << i; } if (P(i, 0, true)==true) // loop cout << setw(4) << i << endl; } }

recursive with loop