Print Numbers from 1 to N without using loop

Table of Contents

Problem
Using Recursion

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions.

In this post, we will see how to print numbers from 1 to N without using loop.

Problem

Print number from 1 to N without using any loop.

N=10
Output: 1 2 3 4 5 6 7 8 9 10

Using Recursion

We can use tail recursion to solve this problem.

Base case
- When n <= 0, return
call printNumbers recursively with n-1
Print number while returning from recursion.

package org.arpit.java2blog;

public class PrintNumbersWithoutLoop {

public static void main(String[] args) {

PrintNumbersWithoutLoop pnwl=new PrintNumbersWithoutLoop();

pnwl.printNumbers(10);

}

public void printNumbers(int n)

{

if(n<=0)

{

return;

}

else

{

// Recursively call printNumbers

printNumbers(n-1);

// Print number while returning from recursion

System.out.print(" "+n);

}

Output

1 2 3 4 5 6 7 8 9 10

That’s all about how to print Numbers from 1 to N without using loop.

Was this post helpful?

Let us know if you liked the post. That’s the only way we can improve.

Author

Maximum number of vowels in a Substring of given length

Algorithm

18 June

Maximum Number of Vowels in a Substring of Given Length

Table of ContentsApproach – 1 Generate All Substrings Using substring() MethodApproach – 2 Using Sliding Window Method (Linear Time Solution) In this article, we will look at an interesting problem related to the Strings and [Sliding-Window Algorithm](https://java2blog.com/sliding-window-maximum-java/ “Sliding-Window Algorithm”). The problem is : "Given a String we have to Find the Maximum Number of Vowel […]

Find first and last position of element in sorted array

Algorithm Array

04 June

Search for a range Leetcode – Find first and last position of element in sorted array

Table of ContentsApproach 1 (Using Linear Search)Approach 2 (Using Modified Binary Search-Optimal) In this article, we will look into an interesting problem asked in Coding Interviews related to Searching Algorithms. The problem is: Given a Sorted Array, we need to find the first and last position of an element in Sorted array. This problem is […]

Algorithm Stack

30 April

Convert Postfix to Infix in Java

Learn about how to convert Postfix to Infix in java.

Algorithm Stack

30 April

Convert Prefix to Postfix in Java

Learn about how to convert Prefix to Postfix in java.

Algorithm Algorithm Interview

16 April

Data Structures in java

Table of ContentsArray Declare and initialize array in javaAdvantages of arrayDisadvantages of array ExampleArray practice programsStackStack implementation using ArrayStack implementation using LinkedListImplementationPractice ProgramsQueueQueue implementation using arrayQueue implementation using LinkedListImplementationLinkedListImplementationLinkedList Practice ProgramsBinary treeImplementationBinary tree practice programsBinary Search treeImplementationBinary search tree Practice programsTrieImplementationHeapImplementationGraphImplementation Inbuild data structures in javaStringHashMapLinkedHashMapArrayListLinkedListHashSet In this post, we will see about various data […]

Algorithm Algorithm Interview Core Java interview

29 November

Top 100+ Java coding interview questions

Table of ContentsStringQuestion 1 : How to reverse a String in java? Can you write a program without using any java inbuilt methods?Question 2 : Write a java program to check if two Strings are anagram in java?Question 3 : Write a program to check if String has all unique characters in java?Question 4 : […]

Print Numbers from 1 to N without using loop

Problem