basic Recursion program in Java

Author: NirmalSilwal

Leetcode/leetcodeTags/Recursion/Print1ToN.java

@@ -0,0 +1,17 @@
+package RecursionSeries;
+
+public class Print1ToN {
+
+	public static void main(String[] args) {
+		int n = 10;
+		printRecursive(n);
+	}
+
+	private static void printRecursive(int n) {
+		if (n == 0)
+			return;
+
+		printRecursive(n - 1);
+		System.out.println(n); // backtracking
+	}
+}

Leetcode/leetcodeTags/Recursion/PrintNtimes.java

@@ -0,0 +1,19 @@
+package RecursionSeries;
+
+public class PrintNtimes {
+
+	public static void main(String[] args) {
+		printRecursive("nirmal", 10);
+	}
+
+	private static void printRecursive(String name, int count) {
+		if (count == 0)
+			return;
+
+		count--;
+
+		System.out.println(name);
+
+		printRecursive(name, count);
+	}
+}

Leetcode/leetcodeTags/Recursion/SumOfNNaturalNumbers.java

@@ -0,0 +1,17 @@
+package RecursionSeries;
+
+public class SumOfNNaturalNumbers {
+
+	public static int sumRecursive(int n) {
+		if (n == 1)
+			return n;
+		
+		int sum = n + sumRecursive(n - 1);
+		
+		return sum;
+	}
+	
+	public static void main(String[] args) {
+		System.out.println(sumRecursive(5));
+	}
+}

Leetcode/leetcodeTags/Recursion/printNto1.java

@@ -0,0 +1,17 @@
+package RecursionSeries;
+
+public class printNto1 {
+
+	public static void main(String[] args) {
+		int n = 10;
+		printRecursive(n);
+	}
+
+	private static void printRecursive(int n) {
+		if (n == 0)
+			return;
+
+		System.out.println(n);
+		printRecursive(n - 1);
+	}
+}