recursion

algorithms/8_recursion/recursion.py

@@ -0,0 +1,16 @@
+def find_sum(n):
+    if n==1:
+        return 1
+    return n + find_sum(n-1)
+
+def fib(n):
+    # 0,1,1,2,3,5,8 <-- fibonacci numbers
+    # --------------
+    # 0,1,2,3,4,5,6 <-- index
+    if n==0 or n==1:
+        return n
+    return fib(n-1) + fib(n-2)
+
+if __name__=='__main__':
+    print(find_sum(5))
+    print(fib(10))