Merge pull request #488 from geeky01adarsh/master

Added two recursion programs

Contributors.html

@@ -584,6 +584,7 @@
 <a class="box-item" href="https://github.com/SamarthSawhney"><spann>Samarth Sawhney</span></a>
 <a class="box-item" href="https://github.com/highflyer910"><span>Thea M.</span></a>
 <a class="box-item" href="https://github.com/nyctonio"><span>Ritesh Kumar</span></a>
+<a class="box-item" href="https://github.com/geeky01adarsh"><span>Adarsh Navneet Sinha</span></a>
 
 
 

Program's_Contributed_By_Contributors/Recursion/factorial_n.cpp

@@ -0,0 +1,19 @@
+// Find the factorial of n
+#include <iostream>
+using namespace std;
+
+int factorial(int n)
+{
+    if (n == 0)
+        return 1;
+    int ans = factorial(n - 1);
+    return n * ans;
+}
+
+int main(int argc, char const *argv[])
+{
+    int n;
+    cin >> n;
+    cout << factorial(n) << endl;
+    return 0;
+}

Program's_Contributed_By_Contributors/Recursion/n_fabonacci_series.cpp

@@ -0,0 +1,20 @@
+// find the nth term of fibonacci series using recursion
+#include<iostream>
+using namespace std;
+
+int fibonacci(int n){
+    if(n==0)
+        return 0;
+    else if(n==1)
+        return 1;
+    int ans = fibonacci(n-1)+fibonacci(n-2);
+    return ans;
+}
+
+int main(int argc, char const *argv[])
+{
+    int n;
+    cin>>n;
+    cout<<fibonacci(n)<<endl;
+    return 0;
+}