Recursion

12345 Recursion

JavaScript

function printNumbers(n) {
    if (n <= 5) {
        console.log(n);
        printNumbers(n + 1);
    }
}

printNumbers(1);

Output:

Python:

def print_numbers(n):
    if n <= 5:    
        print(n)
        print_numbers(n + 1)

print_numbers(1)

Output:

Java

class Main {
    static void printNumbers(int n) {
        if (n <= 5) {
            System.out.println(n);
            printNumbers(n + 1);
        }
    }

    public static void main(String[] args) {
        printNumbers(1);
    }
}

Output:

1 3 5 7 9 Recursion

JavaScript

function printOdd(n) {
    if (n <= 9) {
        console.log(n);
        printOdd(n + 2);
    }
}

printOdd(1);
Output:

Python

def print_odd(n):
    if n <= 9:
        print(n)
        print_odd(n + 2)

print_odd(1)

Output:

Java

class Main {
    static void printOdd(int n) {
        if (n <= 9) {
            System.out.println(n);
            printOdd(n + 2);
        }
    }

    public static void main(String[] args) {
        printOdd(1);
    }
}

Output:

5 10 15 20 25 Recursion

JavaScript

function printMultiples(n) {
    if (n <= 25) {
        console.log(n);
        printMultiples(n + 5);
    }
}

printMultiples(5);

Output:

Python

def print_multiples(n):
    if n <= 25:
        print(n)
        print_multiples(n + 5)

print_multiples(5)

Output:

Java

class Main {
    static void printMultiples(int n) {
        if (n <= 25) {
            System.out.println(n);
            printMultiples(n + 5);
        }
    }

    public static void main(String[] args) {
        printMultiples(5);
    }
}

Output: