Skip to content
Related Articles

Related Articles

Improve Article

Recursive program to print triangular patterns

  • Last Updated : 08 Jun, 2021

We have discussed iterative pattern printing in previous post. 
Examples: 
 

Input : 7
Output :                    
      *
     * *
    * * *
   * * * * 
  * * * * *
 * * * * * *
* * * * * * *

 

Algorithm:- 
step 1:- first think for the base condition i.e. number less then 0 
step 2:-do the recursive calls till number less then 0 i.e:- printPartten(n-1, k+1); 
step 3:-print the spaces 
step 4:-then print * till number
Below is the implementation of above approach:
 

C++




// C++ program to print triangular patterns using Recursive
#include <iostream>
 
using namespace std;
void printPartten(int n, int k)
{
    if (n < 0) // Base condition
        return;
 
    // Recursive call
    printPartten(n - 1, k + 1);
 
    int i;
    for (i = 0; i < k; i++) // it makes spaces
        cout << " ";
    for (i = 0; i < n; i++) // for print *
        printf("* ");
    printf("\n"); // for next line
}
 
int main()
{
    int n = 7;
 
    // Call to printPartten function
    printPartten(n, 0);
    return 0;
}
Java



// Java program to print triangular patterns using Recursive
class GFG{
static void printPartten(int n, int k)
{
    if (n < 0) // Base condition
        return;
 
    // Recursive call
    printPartten(n - 1, k + 1);
 
    int i;
    for (i = 0; i < k; i++) // it makes spaces
        System.out.printf(" ");
    for (i = 0; i < n; i++) // for print *
        System.out.printf("* ");
    System.out.printf("\n"); // for next line
}
 
public static void main(String[]args)
{
    int n = 7;
 
    // Call to printPartten function
    printPartten(n, 0);
}
}
Python3



# Python 3 program to print triangular
# patterns using Recursive
 
def printPartten(n, k):
     
    if (n < 0): # Base condition
        return;
 
    # Recursive call
    printPartten(n - 1, k + 1);
 
    for i in range(0, k): # it makes spaces
        print(" ", end="");
    for i in range(0, n): # for print *
        print("* ", end = "");
    print("\n", end=""); # for next line
 
# Driver Code
n = 7;
 
# Call to printPartten function
printPartten(n, 0);
 
# This code is contributed
# by Akanksha Rai
C#



// C# program to print triangular
// patterns using Recursive
using System;
 
class GFG
{
static void printPartten(int n, int k)
{
    if (n < 0) // Base condition
        return;
 
    // Recursive call
    printPartten(n - 1, k + 1);
 
    int i;
    for (i = 0; i < k; i++) // it makes spaces
        Console.Write(" ");
    for (i = 0; i < n; i++) // for print *
        Console.Write("* ");
    Console.Write("\n"); // for next line
}
 
// Driver Code
public static void Main()
{
    int n = 7;
 
    // Call to printPartten function
    printPartten(n, 0);
}
}
 
// This code is contributed
// by Subhadeep
PHP



<?php
// PHP program to print triangular
// patterns using Recursive
 
function printPartten($n, $k)
{
    if ($n < 0) // Base condition
        return;
 
    // Recursive call
    printPartten($n - 1, $k + 1);
 
    for ($i = 0; $i < $k; $i++) // it makes spaces
        echo " ";
    for ($i = 0; $i < $n; $i++) // for print *
        echo ("* ");
    echo ("\n"); // for next line
}
 
// Driver Code
$n = 7;
 
// Call to printPartten function
printPartten($n, 0);
 
// This code is contributed by jit_t
?>
Javascript



<script>
// javascript program to print triangular patterns using Recursive
 
    function printPartten(n , k) {
        if (n < 0) // Base condition
            return;
 
        // Recursive call
        printPartten(n - 1, k + 1);
 
        var i;
        for (i = 0; i < k; i++) // it makes spaces
             document.write(" ");
        for (i = 0; i < n; i++) // for print *
             document.write("* ");
         document.write("<br/>"); // for next line
    }
 
     
        var n = 7;
 
        // Call to printPartten function
        printPartten(n, 0);
 
// This code is contributed by Rajput-Ji
</script>
Output: 
      * 
     * * 
    * * * 
   * * * * 
  * * * * * 
 * * * * * * 
* * * * * * *
 
How to print its reverse pattern? 
simply Just put the recursive line end of the function 
Example: 
 


Input : 7
Output : 
* * * * * * *
 * * * * * * 
  * * * * *    
   * * * *  
    * * *    
     * *          
      *
 
C++



// C++ program to print reverse triangular
// patterns using Recursive
#include <bits/stdc++.h>
using namespace std;
 
void printPartten(int n, int k)
{
    if (n < 0) // Base condition
        return;
    int i;
    for (i = 0; i < k; i++) // it makes spaces
        cout <<" ";
    for (i = 0; i < n; i++) // for print *
        cout <<"* ";
    cout <<"\n"; // for next line
 
    // Recursive calls
    printPartten(n - 1, k + 1);
}
 
int main()
{
    int n = 7;
 
    // Call to printPartten function
    printPartten(n, 0);
    return 0;
}
// this code is contributed by shivanisinghss2110
C



// C program to print reverse triangular
// patterns using Recursive
#include <stdio.h>
#include <stdlib.h>
 
void printPartten(int n, int k)
{
    if (n < 0) // Base condition
        return;
    int i;
    for (i = 0; i < k; i++) // it makes spaces
        printf( " ");
    for (i = 0; i < n; i++) // for print *
        printf("* ");
    printf("\n"); // for next line
 
    // Recursive calls
    printPartten(n - 1, k + 1);
}
 
int main()
{
    int n = 7;
 
    // Call to printPartten function
    printPartten(n, 0);
    return 0;
}
Java



// Java program to print reverse triangular
// patterns using Recursive
class GFG{
static void printPartten(int n, int k)
{
    if (n < 0) // Base condition
        return;
    int i;
    for (i = 0; i < k; i++) // it makes spaces
        System.out.print(" ");
    for (i = 0; i < n; i++) // for print *
        System.out.print("* ");
    System.out.print("\n"); // for next line
 
    // Recursive calls
    printPartten(n - 1, k + 1);
}
 
public static void main(String[] args)
{
    int n = 7;
 
    // Call to printPartten function
    printPartten(n, 0);
}
}
Python 3



# Python 3 program to print reverse
# triangular patterns using Recursive
 
def printPartten(n, k):
 
    if (n < 0): # Base condition
        return;
    for i in range(0, k): # it makes spaces
        print(" ", end = "")
    for i in range(0, n): # for print *
        print("*", end = " ")
    print("\n", end = "") # for next line
 
    # Recursive calls
    printPartten(n - 1, k + 1);
 
# Driver Code
n = 7;
 
# Call to printPartten function
printPartten(n, 0);
 
# This code is contributed
# by Akanksha Rai
C#



// C# program to print reverse triangular
// patterns using Recursive
using System;
 
class GFG
{
static void printPartten(int n, int k)
{
    if (n < 0) // Base condition
        return;
    int i;
    for (i = 0; i < k; i++) // it makes spaces
        Console.Write(" ");
    for (i = 0; i < n; i++) // for print *
        Console.Write("* ");
    Console.Write("\n"); // for next line
 
    // Recursive calls
    printPartten(n - 1, k + 1);
}
 
// Driver Code
public static void Main()
{
    int n = 7;
 
    // Call to printPartten function
    printPartten(n, 0);
}
}
 
// This code is contributed
// by PrinciRaj1992
PHP



<?php
// PHP program to print reverse triangular
// patterns using Recursive
function printPartten($n, $k)
{
    if ($n < 0) // Base condition
        return;
 
    for ($i = 0; $i < $k; $i++) // it makes spaces
        echo(" ");
    for ($i = 0; $i < $n; $i++) // for print *
        echo("* ");
    echo("\n"); // for next line
 
    // Recursive calls
    printPartten($n - 1, $k + 1);
}
 
// Driver Code
$n = 7;
 
// Call to printPartten function
printPartten($n, 0);
 
// This code is contributed
// by Mukul singh
?>
Javascript



<script>
// C++ program to print reverse triangular
// patterns using Recursive
 
function printPartten(n, k)
{
    if (n < 0) // Base condition
        return;
    let i;
    for (i = 0; i < k; i++) // it makes spaces
        document.write(" ");
    for (i = 0; i < n; i++) // for print *
        document.write("* ");
    document.write("<br>"); // for next line
 
    // Recursive calls
    printPartten(n - 1, k + 1);
}
 
//driver code
    let n = 7;
 
    // Call to printPartten function
    printPartten(n, 0);
  
// this code is contributed by shivanisinghss2110
</script>
Output: 
* * * * * * * 
 * * * * * * 
  * * * * * 
   * * * * 
    * * * 
     * * 
      *
 
Attention reader! Don’t stop learning now. Join the First-Step-to-DSA Course for Class 9 to 12 students , specifically designed to introduce data structures and algorithms to the class 9 to 12 students



My Personal Notes
arrow_drop_up
Previous
Print the given pattern recursively
Next

Program to print hollow pyramid and diamond pattern
Recommended Articles
Page :
Program to print Lower triangular and Upper triangular matrix of an array
19, Jun 17
Program for triangular patterns of alphabets
26, Nov 17
Program to print solid and hollow square patterns
10, Jul 17
Program to print solid and hollow rhombus patterns
10, Jul 17
Program to print hollow rectangle or square star patterns
28, Nov 17
Program to print right and left arrow patterns
18, Dec 17
Program to print diagonal star patterns
03, Jan 18
Print lower triangular matrix pattern from given array
28, Jan 18
Recursive program to print formula for GCD of n integers
19, Jul 18
Print different star patterns in SQL
22, Dec 17
Print Patterns in PL/SQL
10, May 18
Programs to print Interesting Patterns
21, Apr 17
Programs to print Triangle and Diamond patterns using recursion
30, Jul 19
Program to check if matrix is upper triangular
10, Dec 17
Program to check if matrix is lower triangular
13, Dec 17
Program for triangular pattern (mirror image around 0)
19, Dec 17
Program for Stair Case Patterns
27, Dec 17
Triangular Numbers
07, Mar 16
Sum of the series 1, 3, 6, 10... (Triangular Numbers)
03, Dec 17
Hollow lower triangular pattern
31, Dec 17
Maximum height of triangular arrangement of array values
05, May 18
Swap upper and lower triangular halves of a given Matrix
29, Dec 20
Convert given upper triangular Matrix to 1D Array
07, Dec 20
Triangular Matchstick Number
20, Mar 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty





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