Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Print even and odd numbers in a given range using recursion

  • Difficulty Level : Basic
  • Last Updated : 23 Apr, 2021

Given two integers L and R, the task is to print all the even and odd numbers from L to R using recursion.

Examples:

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input: L = 1, R = 10
Output: 
Even numbers: 2 4 6 8 10
Odd numbers: 1 3 5 7 9



Input: L = 10, R = 25 
Output: 
Even numbers:10 12 14 16 18 20 22 24 
Odd numbers:11 13 15 17 19 21 23 25

Approach: Follow the steps below to solve the problem using Recursion:

  • Traverse the range [R, L].
  • Print the odd elements from the range using recursion using the following recurrence relation:

Odd(L, R) = R % 2 == 1? Odd(L, R – 2) : Odd(L, R – 1) 

  • Print the even elements from the range using recursion using the following recurrence relation:

Even(L, R) = R % 2 == 0 ? Even(L, R – 2) : Even(L, R – 1) 

Below is the implementation of the above approach:

C++




// C++ program to implement
// the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to print all the
// even numbers from L to R
void Even(int L, int R)
{
 
    // Base case
    if (R < L) {
        return;
    }
 
    // Recurrence relation
    R % 2 == 0 ? Even(L, R - 2)
               : Even(L, R - 1);
 
    // Check if R is even
    if (R % 2 == 0) {
        cout << R << " ";
    }
}
 
// Function to print all the
// odd numbers from L to R
void Odd(int L, int R)
{
 
    // Base case
    if (R < L) {
        return;
    }
 
    // Recurrence relation
    R % 2 == 1 ? Odd(L, R - 2)
               : Odd(L, R - 1);
 
    // Check if R is even
    if (R % 2 == 1) {
        cout << R << " ";
    }
}
 
// Driver Code
int main()
{
    int L = 10, R = 25;
    cout << "Even numbers:";
 
    // Print all the
    // even numbers
    Even(L, R);
    cout << endl;
 
    // Print all the
    // odd numbers
    cout << "Odd numbers:";
    Odd(L, R);
}
Java



// Java program to implement
// the above approach
import java.util.*;
class GFG{
 
// Function to print
// all the even numbers
// from L to R
static void Even(int L,
                 int R)
{
  // Base case
  if (R < L)
  {
    return;
  }
 
  // Recurrence relation
  if(R % 2 == 0 )
    Even(L, R - 2);
  else
    Even(L, R - 1);
 
  // Check if R is even
  if (R % 2 == 0)
  {
    System.out.print(R + " ");
  }
}
 
// Function to print
// all the odd numbers
// from L to R
static void Odd(int L,
                int R)
{
  // Base case
  if (R < L)
  {
    return;
  }
 
  // Recurrence relation
  if(R % 2 == 1 )
    Odd(L, R - 2);
  else
    Odd(L, R - 1);
 
  // Check if R is even
  if (R % 2 == 1)
  {
    System.out.print(R + " ");
  }
}
 
// Driver Code
public static void main(String[] args)
{
  int L = 10, R = 25;
  System.out.print("Even numbers:");
 
  // Print all the
  // even numbers
  Even(L, R);
  System.out.println();
 
  // Print all the
  // odd numbers
  System.out.print("Odd numbers:");
  Odd(L, R);
}
}
 
// This code is contributed by Rajput-Ji
Python3



# Python3 program to implement
# the above approach
 
# Function to print all the
# even numbers from L to R
def Even(L, R):
     
    # Base case
    if (R < L):
        return
 
    # Recurrence relation
    if (R % 2 == 0):
        Even(L, R - 2)
    else:
        Even(L, R - 1)
 
    # Check if R is even
    if (R % 2 == 0):
        print(R, end = " ")
 
# Function to print all the
# odd numbers from L to R
def Odd(L, R):
     
    # Base case
    if (R < L):
        return
 
    # Recurrence relation
    if (R % 2 == 1):
        Odd(L, R - 2)
    else:
        Odd(L, R - 1)
 
    # Check if R is even
    if (R % 2 == 1):
        print(R, end = " ")
 
# Driver Code
if __name__ == '__main__':
     
    L = 10
    R = 25
     
    print("Even numbers:")
 
    # Print all the
    # even numbers
    Even(L, R)
    print()
 
    # Print all the
    # odd numbers
    print("Odd numbers:")
    Odd(L, R)
 
# This code is contributed by Amit Katiyar
C#



// C# program to implement
// the above approach
using System;
class GFG{
 
// Function to print
// all the even numbers
// from L to R
static void Even(int L,
                 int R)
{
  // Base case
  if (R < L)
  {
    return;
  }
 
  // Recurrence relation
  if(R % 2 == 0 )
    Even(L, R - 2);
  else
    Even(L, R - 1);
 
  // Check if R is even
  if (R % 2 == 0)
  {
    Console.Write(R + " ");
  }
}
 
// Function to print
// all the odd numbers
// from L to R
static void Odd(int L,
                int R)
{
  // Base case
  if (R < L)
  {
    return;
  }
 
  // Recurrence relation
  if(R % 2 == 1 )
    Odd(L, R - 2);
  else
    Odd(L, R - 1);
 
  // Check if R is even
  if (R % 2 == 1)
  {
    Console.Write(R + " ");
  }
}
 
// Driver Code
public static void Main(String[] args)
{
  int L = 10, R = 25;
  Console.Write("Even numbers:");
 
  // Print all the
  // even numbers
  Even(L, R);
  Console.WriteLine();
 
  // Print all the
  // odd numbers
  Console.Write("Odd numbers:");
  Odd(L, R);
}
}
 
// This code is contributed by 29AjayKumar
Javascript



<script>
 
// Java script program to implement
// the above approach
 
// Function to print
// all the even numbers
// from L to R
function Even(L, R)
{
     
    // Base case
    if (R < L)
    {
        return;
    }
     
    // Recurrence relation
    if (R % 2 == 0 )
    {
        Even(L, R - 2);
    }
    else
    {
        Even(L, R - 1);
    }
     
    // Check if R is even
    if (R % 2 == 0)
    {
        document.write(R + " ");
    }
}
 
// Function to print
// all the odd numbers
// from L to R
function Odd(L, R)
{
     
    // Base case
    if (R < L)
    {
        return;
    }
     
    // Recurrence relation
    if (R % 2 == 1 )
    {
        Odd(L, R - 2);
    }
    else
    {
        Odd(L, R - 1);
    }
     
    // Check if R is even
    if (R % 2 == 1)
    {
        document.write(R + " ");
    }
}
 
// Driver Code
let L = 10;
let R = 25;
document.write("Even numbers:");
 
// Print all the
// even numbers
Even(L, R);
document.write("<br>");
 
// Print all the
// odd numbers
document.write("Odd numbers:");
Odd(L, R);
 
// This code is contributed by sravan kumar G
 
</script>
Output: 
Even numbers:10 12 14 16 18 20 22 24 
Odd numbers:11 13 15 17 19 21 23 25
 
Time Complexity: O(N)
Auxiliary Space: O(1)



My Personal Notes
arrow_drop_up
Previous
Choose element(s) from List with different probability in Python
Next

Count possible permutations of given array satisfying the given conditions
Recommended Articles
Page :
Count numbers from given range having odd digits at odd places and even digits at even places
02, Dec 20
Count of integers in a range which have even number of odd digits and odd number of even digits
21, Aug 19
Count of numbers of length N having prime numbers at odd indices and odd numbers at even indices
25, Aug 21
Find the nearest odd and even perfect squares of odd and even array elements respectively
05, Mar 21
Check if a number has an odd count of odd divisors and even count of even divisors
20, Aug 20
Modify Binary Tree by replacing all nodes at even and odd levels by their nearest even or odd perfect squares respectively
22, Feb 21
Count N-digits numbers made up of even and prime digits at odd and even positions respectively
29, Jul 21
Sum of elements in range L-R where first half and second half is filled with odd and even numbers
08, Aug 18
Check whether XOR of all numbers in a given range is even or odd
23, Jan 19
Count numbers in given range such that sum of even digits is greater than sum of odd digits
26, Jun 19
Kth element in permutation of first N natural numbers having all even numbers placed before odd numbers in increasing order
03, Mar 21
Count Odd and Even numbers in a range from L to R
25, Jan 19
Count even and odd Bitwise XORs of consecutive numbers in a range [L, R] starting from L
10, Feb 21
Count Numbers in Range with difference between Sum of digits at even and odd positions as Prime
22, Feb 19
Count of N-digit Numbers having Sum of even and odd positioned digits divisible by given numbers
07, Aug 20
Print all n-digit numbers with absolute difference between sum of even and odd digits is 1
31, Jul 16
Print all distinct even and odd prefix Bitwise XORs of first N natural numbers
07, May 21
Sum of range in a series of first odd then even natural numbers
24, Apr 18
Generate an array of given size with equal count and sum of odd and even numbers
10, May 20
Make all the elements of array odd by incrementing odd-indexed elements of odd-length subarrays
16, Dec 20
Print odd positioned nodes of odd levels in level order of the given binary tree
05, Sep 19
Print even positioned nodes of odd levels in level order of the given binary tree
06, Sep 19
Print odd positioned nodes of even levels in level order of the given binary tree
06, Sep 19
Number of odd and even results for every value of x in range [min, max] after performing N steps
18, Jul 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
KetanGupta
@KetanGupta
Vote for difficulty
Current difficulty :
Basic





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox