Merge pull request #87 from anjalibarnwal31/main

Ackermann.py added in recursion

Author: BeeBombshell

README.md

@@ -37,6 +37,7 @@ The following topics will be elaborated:
  * Linear Search
  * Binary Search
 * Recursion
+ * Ackermann Function
 * Backtracking
 * Dynamic Programming
 * Linked List

Recursion/Ackermann.py

@@ -0,0 +1,10 @@
+def Ackermann(m, n):
+ if m == 0:
+ return n + 1
+ elif m > 0 and n == 0:
+ return Ackermann(m - 1, 1)
+ else:
+ return Ackermann(m - 1, Ackermann(m, n - 1)) 
+m = int(input())
+n = int(input()) 
+print(Ackermann(m, n))