Dado un entero positivo n . Imprima el patrón triangular invertido (como se describe en los ejemplos a continuación) usando el enfoque recursivo.
Ejemplos:
Input : n = 5 Output : * * * * * * * * * * * * * * * Input : n = 7 Output : * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Método 1 (usando dos funciones recursivas): una función recursiva se usa para obtener el número de fila y la otra función recursiva se usa para imprimir las estrellas de esa fila en particular.
Algoritmo:
printPatternRowRecur(n) if n < 1 return print "* " printPatternRowRecur(n-1) printPatternRecur(n) if n < 1 return printPatternRowRecur(n) print "\n" printPatternRecur(n-1)
C++
// C++ implementation to print the given // pattern recursively #include <bits/stdc++.h> using namespace std; // function to print the 'n-th' row of the // pattern recursively void printPatternRowRecur(int n) { // base condition if (n < 1) return; // print the remaining stars of the n-th row // recursively cout << "* "; printPatternRowRecur(n-1); } void printPatternRecur(int n) { // base condition if (n < 1) return; // print the stars of the n-th row printPatternRowRecur(n); // move to next line cout << endl; // print stars of the remaining rows recursively printPatternRecur(n-1); } // Driver program to test above int main() { int n = 5; printPatternRecur(n); return 0; }
Java
// java implementation to print the given // pattern recursively import java.io.*; class GFG { // function to print the 'n-th' row // of the pattern recursively static void printPatternRowRecur(int n) { // base condition if (n < 1) return; // print the remaining stars // of the n-th row recursively System.out.print( "* "); printPatternRowRecur(n - 1); } static void printPatternRecur(int n) { // base condition if (n < 1) return; // print the stars of the n-th row printPatternRowRecur(n); // move to next line System.out.println (); // print stars of the // remaining rows recursively printPatternRecur(n - 1); } // Driver program to test above public static void main (String[] args) { int n = 5; printPatternRecur(n); } } //This code is contributed by vt_m
Python3
# Python 3 implementation # to print the given # pattern recursively # function to print the # 'n-th' row of the # pattern recursively def printPatternRowRecur(n): # base condition if (n < 1): return # print the remaining # stars of the n-th row # recursively print("*", end = " ") printPatternRowRecur(n - 1) def printPatternRecur(n): # base condition if (n < 1): return # print the stars of # the n-th row printPatternRowRecur(n) # move to next line print("") # print stars of the # remaining rows recursively printPatternRecur(n - 1) # Driver Code n = 5 printPatternRecur(n) # This code is contributed # by Smitha
C#
// C# implementation to print the given // pattern recursively using System; class GFG { // function to print the 'n-th' row // of the pattern recursively static void printPatternRowRecur(int n) { // base condition if (n < 1) return; // print the remaining stars // of the n-th row recursively Console.Write( "* "); printPatternRowRecur(n - 1); } static void printPatternRecur(int n) { // base condition if (n < 1) return; // print the stars of the n-th row printPatternRowRecur(n); // move to next line Console.WriteLine(); // print stars of the // remaining rows recursively printPatternRecur(n - 1); } // Driver program to test above public static void Main() { int n = 5; printPatternRecur(n); } } //This code is contributed by vt_m
PHP
<?php // php implementation to print the given // pattern recursively // function to print the 'n-th' row // of the pattern recursively function printPatternRowRecur($n) { // base condition if ($n < 1) return; // print the remaining stars of // the n-th row recursively echo "* "; printPatternRowRecur($n-1); } function printPatternRecur($n) { // base condition if ($n < 1) return; // print the stars of the n-th row printPatternRowRecur($n); // move to next line echo "\n"; // print stars of the remaining // rows recursively printPatternRecur($n-1); } // Driver code $n = 5; printPatternRecur($n); // This code is contributed by mits ?>
Javascript
<script> // JavaScript implementation to print the given // pattern recursively // function to print the 'n-th' row // of the pattern recursively function printPatternRowRecur(n) { // base condition if (n < 1) return; // print the remaining stars // of the n-th row recursively document.write( "* "); printPatternRowRecur(n - 1); } function printPatternRecur(n) { // base condition if (n < 1) return; // print the stars of the n-th row printPatternRowRecur(n); // move to next line document.write("<br>"); // print stars of the // remaining rows recursively printPatternRecur(n - 1); } // Driver program to test above var n = 5; printPatternRecur(n); // This code is contributed by Amit Katiyar </script>
Producción:
* * * * * * * * * * * * * * *
Método 2 (usando una sola función recursiva): este enfoque usa una sola función recursiva para imprimir el patrón completo.
Algoritmo:
printPatternRecur(n, i) if n < 1 return if i <= n print "* " printPatternRecur(n, i+1) else print "\n" printPatternRecur(n-1, 1)
C++
// C++ implementation to print the given pattern recursively #include <bits/stdc++.h> using namespace std; // function to print the given pattern recursively void printPatternRecur(int n, int i) { // base condition if (n < 1) return; // to print the stars of a particular row if (i <= n) { cout << "* "; // recursively print rest of the stars // of the row printPatternRecur(n, i + 1); } else { // change line cout << endl; // print stars of the remaining rows recursively printPatternRecur(n-1, 1); } } // Driver program to test above int main() { int n = 5; printPatternRecur(n, 1); return 0; }
Java
// java implementation to // print the given pattern recursively import java.io.*; class GFG { // function to print the // given pattern recursively static void printPatternRecur(int n, int i) { // base condition if (n < 1) return; // to print the stars of // a particular row if (i <= n) { System.out.print ( "* "); // recursively print rest // of the stars of the row printPatternRecur(n, i + 1); } else { // change line System.out.println( ); // print stars of the // remaining rows recursively printPatternRecur(n - 1, 1); } } // Driver program public static void main (String[] args) { int n = 5; printPatternRecur(n, 1); } } // This code is contributed by vt_m
Python3
# Python3 implementation to print the # given pattern recursively # function to print the given pattern # recursively def printPatternRecur(n, i): # base condition if (n < 1): return # to print the stars of a # particular row if (i <= n): print("* ", end = "") # recursively print rest of # the stars of the row printPatternRecur(n, i + 1) else: # change line print("") # print stars of the remaining # rows recursively printPatternRecur(n-1, 1) # Driver program to test above n = 5 printPatternRecur(n, 1) # This code is contributed by Smitha
C#
// C# implementation to // print the given pattern recursively using System; class GFG { // function to print the // given pattern recursively static void printPatternRecur(int n, int i) { // base condition if (n < 1) return; // to print the stars of // a particular row if (i <= n) { Console.Write ( "* "); // recursively print rest // of the stars of the row printPatternRecur(n, i + 1); } else { // change line Console.WriteLine( ); // print stars of the // remaining rows recursively printPatternRecur(n - 1, 1); } } // Driver program public static void Main () { int n = 5; printPatternRecur(n, 1); } } // This code is contributed by vt_m
PHP
<?php // php implementation to print // the given pattern recursively // function to print the given // pattern recursively function printPatternRecur($n, $i) { // base condition if ($n < 1) return; // to print the stars of // a particular row if ($i <= $n) { echo "* "; // recursively print rest of // the stars of the row printPatternRecur($n, $i + 1); } else { // change line echo "\n"; // print stars of the remaining // rows recursively printPatternRecur($n - 1, 1); } } // Driver code $n = 5; printPatternRecur($n, 1); // This code is contributed by mits ?>
Javascript
<script> // JavaScript implementation to print // the given pattern recursively // Function to print the given // pattern recursively function printPatternRecur(n, i) { // Base condition if (n < 1) return; // To print the stars of // a particular row if (i <= n) { document.write("*" + " "); // Recursively print rest of the stars // of the row printPatternRecur(n, i + 1); } else { // Change line document.write("<br>"); // Print stars of the remaining // rows recursively printPatternRecur(n - 1, 1); } } // Driver code var n = 5; printPatternRecur(n, 1); // This code is contributed by rdtank </script>
Producción:
* * * * * * * * * * * * * * *
Este artículo es una contribución de Ayush Jauhari . Si te gusta GeeksforGeeks y te gustaría contribuir, también puedes escribir un artículo usando write.geeksforgeeks.org o enviar tu artículo por correo a review-team@geeksforgeeks.org. Vea su artículo que aparece en la página principal de GeeksforGeeks y ayude a otros Geeks.
Escriba comentarios si encuentra algo incorrecto o si desea compartir más información sobre el tema tratado anteriormente.
Publicación traducida automáticamente
Artículo escrito por GeeksforGeeks-1 y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA