Recursive program to print triangular patterns
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; } |
chevron_right
filter_none
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 ); } } |
chevron_right
filter_none
Python 3
# 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 |
chevron_right
filter_none
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 |
chevron_right
filter_none
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 ?> |
chevron_right
filter_none
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 <iostream> 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 * 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; } |
chevron_right
filter_none
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 ); } } |
chevron_right
filter_none
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 |
chevron_right
filter_none
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 |
chevron_right
filter_none
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 ?> |
chevron_right
filter_none
Output:
* * * * * * * * * * * * * * * * * * * * * * * * * * * *
Recommended Posts:
- Program for triangular patterns of alphabets
- Program to print Lower triangular and Upper triangular matrix of an array
- Program to print diagonal star patterns
- Program to print right and left arrow patterns
- Program to print solid and hollow square patterns
- Program to print solid and hollow rhombus patterns
- Program to print hollow rectangle or square star patterns
- Recursive program to print formula for GCD of n integers
- Print Patterns in PL/SQL
- Print different star patterns in SQL
- Print lower triangular matrix pattern from given array
- Programs to print Interesting Patterns
- Programs to print Triangle and Diamond patterns using recursion
- Program for triangular pattern (mirror image around 0)
- Program to check if matrix is upper triangular