Program to Print First N Natural Numbers

Counting numbers like 1, 2, 3, 4, 5, 6 … Basically, all integers greater than 0 are natural numbers. 

Facts about Natural numbers 

1. The natural numbers are the ordinary numbers, 1, 2, 3, etc., with which we count.
2. The next possible natural number can be found by adding 1 to the current natural number
3. The number zero is sometimes considered to be a natural number. Not always because no one counts starting with zero, 0, 1, 2, 3.
4. GCD of all other natural numbers with a prime is always one.
5. The natural numbers can be defined formally by relating them to sets. Then, zero is the number of elements in the empty set; 1 is the number of elements in the set containing one natural number; and so on.

Iterative Approach

// C++ Program to print first n natural numbers

#include <iostream>
using namespace std;

void printNaturalNumbers(int n) {
  	
    for(int i = 1; i <= n; i++) {
    	cout << i << " ";
    }
}

int main() {

    int n = 10;
    printNaturalNumbers(n);
    
    return 0;
}

// C Program to print first n natural numbers

#include <stdio.h>

void printNaturalNumbers(int n) {
    for(int i = 1; i <= n; i++) {
        printf("%d ", i);
    }
}

int main() {
    int n = 10;
    printNaturalNumbers(n);
    
    return 0;
}

// Java Program to print first n natural numbers

class GfG {
    
    static void printNaturalNumbers(int n) {
        for(int i = 1; i <= n; i++) {
            System.out.print(i + " ");
        }
    }

    public static void main(String[] args) {
        int n = 10;
        printNaturalNumbers(n);
    }
}

# Python Program to print first n natural numbers

def printNaturalNumbers(n):
    for i in range(1, n + 1):
        print(i, end=" ")

if __name__ == "__main__":
    n = 10
    printNaturalNumbers(n)

// C# Program to print first n natural numbers

using System;

class GfG {
    static void printNaturalNumbers(int n) {
        for(int i = 1; i <= n; i++) {
            Console.Write(i + " ");
        }
    }

    static void Main() {
        int n = 10;
        printNaturalNumbers(n);
    }
}

// JavaScript Program to print first n natural numbers

function printNaturalNumbers(n) {
    for (let i = 1; i <= n; i++) {
        console.log(i);
    }
}

let n = 10;
printNaturalNumbers(n);

1 2 3 4 5 6 7 8 9 10 

Time Complexity: O(n)
Auxiliary Space: O(1)

Recursive Approach

// C++ Program to print first n natural numbers
// using Recursion

#include <iostream>
using namespace std;

void printNaturalNumbers(int n) {
    
    // Print till number is greater than 0
    if(n > 0) {
      	printNaturalNumbers(n - 1);
        cout << n << " ";
    }
}

int main() {

    int n = 10;
    printNaturalNumbers(n);
    
    return 0;
}

// C Program to print first n natural numbers
// using Recursion

#include <stdio.h>

void printNaturalNumbers(int n) {
    
    // Print till number is greater than 0
    if(n > 0) {
        printNaturalNumbers(n - 1);
        printf("%d ", n);
    }
}

int main() {
    int n = 10;
    printNaturalNumbers(n);
    
    return 0;
}

// Java Program to print first n natural numbers
// using Recursion

class GfG {

    static void printNaturalNumbers(int n) {
        
        // Print till number is greater than 0
        if (n > 0) {
            printNaturalNumbers(n - 1);
            System.out.print(n + " ");
        }
    }

    public static void main(String[] args) {
        int n = 10;
        printNaturalNumbers(n);
    }
}

# Python Program to print first n natural numbers
# using Recursion

def printNaturalNumbers(n):
    
    # Print till number is greater than 0
    if n > 0:
        printNaturalNumbers(n - 1)
        print(n, end=" ")

if __name__ == "__main__":
    n = 10
    printNaturalNumbers(n)

// C# Program to print first n natural numbers
// using Recursion

using System;

class GfG {
    static void printNaturalNumbers(int n) {
        
        // Print till number is greater than 0
        if (n > 0) {
            printNaturalNumbers(n - 1);
            Console.Write(n + " ");
        }
    }

    static void Main() {
        int n = 10;
        printNaturalNumbers(n);
    }
}

// JavaScript Program to print first n natural numbers
// using Recursion

function printNaturalNumbers(n) {
    
    // Print till number is greater than 0
    if (n > 0) {
        printNaturalNumbers(n - 1);
        process.stdout.write(n + " ");
    }
}

const n = 10;
printNaturalNumbers(n);

1 2 3 4 5 6 7 8 9 10 

Time Complexity: O(n)
Auxiliary Space: O(n)

More problems related to Natural Number:  

• Program to find sum of first n natural numbers
• Count natural numbers whose all permutations are greater than that number
• Sum of squares of first n natural numbers
• Sum of cubes of even and odd natural numbers
• LCM of First n Natural Numbers
• Sum of squares of first n natural numbers