Understanding Recursion with Simple Examples?

What is Recursion ? Recursion is when a function calls itself to solve a problem. Every recursion has 2 mandatory parts: Base Case (Stopping condition) If you don’t have this → your program will crash (infinite recursion) Recursive Call Function calls itself with a smaller/simpler input Examples: 1.1 2 3 4 5 flowchart: -In python : def display(num): if num > 5: return print(num) display(num + 1) display(1) output: -In Java : class Main { static void display(int num) { if (num > 5) { return; } System.out.println(num); display(num + 1); } public static void main(String[] args) { display(1); } } -In Javascript: function display(num) { if (num > 5) return; console.log(num); display(num + 1); } display(1); 2.1 3 5 7 9 : flow chart: In python: def display(num): if num > 9: return print(num) display(num + 2) display(1) output: In Java : class Main { static void display(int num) { if (num > 9) { return; } System.out.println(num); display(num + 2); } public static void main(String[] args) { dis