Day 9

Author: geekayush

Day9-Recursion/C++/main.cpp

@@ -0,0 +1,14 @@
+#include <iostream>
+
+using namespace std;
+
+int factorial(int n) {
+    return (n > 1) ? n * factorial(n - 1) : 1;
+}
+
+int main() {
+    int n;
+    cin >> n;
+    cout << factorial(n);
+    return 0;
+}

Day9-Recursion/C/main.c

@@ -0,0 +1,14 @@
+#include <stdio.h>
+
+int factorial(int n){
+    
+    return (n == 1) ? 1 : n * factorial(n - 1);
+    
+};
+
+int main() {
+    int n;
+    scanf("%d", &n);
+    printf("%d", factorial(n));
+    return 0;
+}

Day9-Recursion/Java/main.java

@@ -0,0 +1,13 @@
+public class Solution {
+
+    public static int factorial(int n){
+        return (n > 1) ? n * factorial(n - 1) : 1;
+    }
+    
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        int n = scan.nextInt();
+        scan.close();
+        System.out.println(factorial(n));
+    }
+}

Day9-Recursion/README.md

@@ -0,0 +1,30 @@
+## Objective 
+Today, we're learning and practicing an algorithmic concept called Recursion.
+
+## Task 
+Write a factorial function that takes a positive integer, N as a parameter and prints the result of N! (N factorial).
+
+## Input Format
+```
+A single integer, N (the argument to pass to factorial).
+```
+
+## Constraints
+```
+Your submission must contain a recursive function named factorial.
+```
+
+## Output Format
+```
+Print a single integer denoting .
+```
+
+## Sample Input
+```
+3
+```
+
+## Sample Output
+```
+6
+```

README.md

@@ -15,7 +15,7 @@ The repository covers all the basic topics of programming languages. Try a new c
 - [Day 6 - Review](https://github.com/geekayush/30daysofcode/tree/master/Day6-Review)
 - [Day 7 - Arrays](https://github.com/geekayush/30daysofcode/tree/master/Day7-Arrays)
 - [Day 8 - Dictionaries&Maps](https://github.com/geekayush/30daysofcode/tree/master/Day8-Dictionaries&Maps)
-
+- [Day 9 - Recursion](https://github.com/geekayush/30daysofcode/tree/master/Day9-Recursion)
 
 ##### How to contribute?