Programs to print Interesting Patterns - GeeksforGeeks

06 Jul, 2021
Program to print following pattern: 
Examples : 
Input : 5
Output: 
* * * * *  * * * * *
* * * *      * * * *
* * *          * * *
* *              * *
*                  *
*                  *
* *              * *
* * *          * * *
* * * *      * * * *
* * * * *  * * * * *
This program is divided into four parts.
C++
C
Java
Python3
C#
PHP
Javascript
// C++ program to print// the given pattern#include<iostream>using namespace std; void pattern(int n){    int i, j;         // This is upper half of pattern    for(i = 1; i <= n; i++)    {        for(j = 1; j <= (2 * n); j++)        {                         // Left part of pattern            if (i > (n - j + 1))                cout << " ";            else                cout << "*";                              // Right part of pattern            if ((i + n) > j)                cout << " ";            else                cout << "*";        }        cout << endl ;    }          // This is lower half of pattern    for(i = 1; i <= n; i++)    {        for(j = 1; j <= (2 * n); j++)        {                         // Right Part of pattern            if (i < j)                cout << " ";            else                cout << "*";                          // Left Part of pattern            if (i <= ((2 * n) - j))                cout << " ";            else                cout << "*";        }        cout << endl;    }}  // Driver Codeint main(){    pattern(7);         return 0;} // This code is contributed by bunnyram19
// C program to print// the given pattern #include<stdio.h>void pattern(int n){    int i,j;     // This is upper half of pattern    for (i=1; i<=n; i++)    {        for (j=1; j<=(2*n); j++)        {            // Left part of pattern            if (i>(n-j+1))                printf(" ");            else                printf("*");                             // Right part of pattern            if ((i+n)>j)                printf(" ");            else                printf("*");        }        printf("\n");    }         // This is lower half of pattern    for (i=1; i<=n; i++)    {        for (j=1; j<=(2*n); j++)        {            // Right Part of pattern            if (i<j)                printf(" ");            else                printf("*");                         // Left Part of pattern            if (i<=((2*n)-j))                printf(" ");            else                printf("*");        }        printf("\n");    }} // Driver Codeint main(){    pattern(7);    return 0;}
// Java program to print// the given patternimport java.io.*; class GFG {         static void pattern(int n)    {        int i, j;         // This is upper half of pattern        for (i = 1; i <= n; i++) {            for (j = 1; j <= (2 * n); j++) {                                 // Left part of pattern                if (i > (n - j + 1))                    System.out.print(" ");                else                    System.out.print("*");                 // Right part of pattern                if ((i + n) > j)                    System.out.print(" ");                else                    System.out.print("*");            }                         System.out.println("");        }         // This is lower half of pattern        for (i = 1; i <= n; i++) {            for (j = 1; j <= (2 * n); j++) {                                 // Right Part of pattern                if (i < j)                    System.out.print(" ");                else                    System.out.print("*");                 // Left Part of pattern                if (i <= ((2 * n) - j))                    System.out.print(" ");                else                    System.out.print("*");            }                         System.out.println("");        }    }     // Driver Code    public static void main(String[] args)    {        pattern(7);    }} // This code is contributed by vt_m
# Python3 program to print# the given pattern def pattern(n):         # This is upper half of pattern    for i in range (1, n + 1):        for j in range (1, 2 * n):                         # Left part of pattern            if i > (n - j + 1):                print("", end = ' ');            else:                print("*", end = '');                             # Right part of pattern            if i + n - 1 > j:                print("", end = ' ');            else:                print("*", end = '');        print("");             # This is lower half of pattern    for i in range (1, n + 1):        for j in range (1, 2 * n):            #Left part of pattern            if i < j:                print("", end = ' ');            else:                print("*", end = '');                             # Right part of pattern            if i < 2 * n - j:                print("", end = ' ');            else:                print("*", end = '');        print("");         # Driver Codepattern(7); # This code is contributed by mits
// C# program to print// the given patternusing System; class GFG{    static void pattern(int n)    {        int i, j;         // This is upper        // half of pattern        for (i = 1; i <= n; i++)        {            for (j = 1; j <= (2 * n); j++)            {                                 // Left part of pattern                if (i > (n - j + 1))                    Console.Write(" ");                else                    Console.Write("*");                 // Right part of pattern                if ((i + n) > j)                    Console.Write(" ");                else                    Console.Write("*");            }                         Console.WriteLine("");        }         // This is lower        // half of pattern        for (i = 1; i <= n; i++)        {            for (j = 1; j <= (2 * n); j++)            {                                 // Right Part of pattern                if (i < j)                    Console.Write(" ");                else                    Console.Write("*");                 // Left Part of pattern                if (i <= ((2 * n) - j))                    Console.Write(" ");                else                    Console.Write("*");            }                         Console.WriteLine("");        }    }         // Driver Code    static public void Main ()    {        pattern(7);    }} // This code is contributed by ajit
<?php// PHP program to print// the given pattern function pattern($n){    $i; $j;     // This is upper half of pattern    for ($i = 1; $i <= $n; $i++)    {        for ($j = 1; $j <= (2 * $n); $j++)        {            // Left part of pattern            if ($i > ($n - $j + 1))                echo " ";            else                echo "*";                             // Right part of pattern            if (($i + $n) > $j)                echo " ";            else                echo "*";        }        printf("\n");    }         // This is lower half of pattern    for ($i = 1; $i <= $n; $i++)    {        for ($j = 1; $j <= (2 * $n); $j++)        {            // Right Part of pattern            if ($i < $j)                echo " ";            else                echo "*";                         // Left Part of pattern            if ($i <= ((2 * $n) - $j))                echo " ";            else                echo "*";        }        echo "\n";    }} // Driver Codepattern(7); // This code is contributed by m_kit?>
<script>       // JavaScript program to print      // the given pattern       function pattern(n) {        var i, j;         // This is upper half of pattern        for (i = 1; i <= n; i++) {          for (j = 1; j <= 2 * n; j++) {            // Left part of pattern            if (i > n - j + 1)            document.write("  ");            else            document.write("*");             // Right part of pattern            if (i + n > j)            document.write("  ");            else            document.write("*");          }          document.write("<br>");        }         // This is lower half of pattern        for (i = 1; i <= n; i++) {          for (j = 1; j <= 2 * n; j++) {            // Right Part of pattern            if (i < j)            document.write("  ");            else            document.write("*");             // Left Part of pattern            if (i <= 2 * n - j)            document.write("  ");            else            document.write("*");          }          document.write("<br>");        }      }       // Driver Code      pattern(7);           </script>
Output : 
* * * * * * *  * * * * * * *
* * * * * *      * * * * * *
* * * * *          * * * * *
* * * *              * * * *
* * *                  * * *
* *                      * *
*                          *
*                          *
* *                      * *
* * *                  * * *
* * * *              * * * *
* * * * *          * * * * *
* * * * * *      * * * * * *
* * * * * * *  * * * * * * *
Program to print following pattern: 
Examples : 
Input : 5
Output: 
*                  *
* *              * *
* * *          * * *
* * * *      * * * *
* * * * *  * * * * *
* * * * *  * * * * *
* * * *      * * * *
* * *          * * *
* *              * *
*                  *
This program is divided into four parts. 
C++
C
Java
Python3
C#
PHP
Javascript
// C++ program to print the// given pattern#include <bits/stdc++.h>using namespace std; void pattern(int n){    int i, j;         // This is upper half of pattern    for (i = 1; i <= n; i++)    {        for (j = 1; j <= (2 * n); j++)        {            // Left part of pattern            if (i < j)                cout << " ";            else                cout << "*";                         // Right part of pattern            if (i <= ((2 * n) - j))                cout << " ";            else                cout << "*";        }        cout << "\n";    }         // This is lower half of pattern    for (i = 1; i <= n; i++)    {        for (j = 1; j <= (2 * n); j++)        {            // Left part of pattern            if (i > (n - j + 1))                cout <<" ";            else                cout <<"*";                             // Right part of pattern            if ((i + n) > j)                cout << " ";            else                cout << "*";        }        cout << "\n";    }} // Driver Codeint main(){    pattern(7);    return 0;} // This code is contributed by shivanisinghss2110
// C program to print the// given pattern #include<stdio.h>void pattern(int n){    int i,j;         // This is upper half of pattern    for (i=1; i<=n; i++)    {        for (j=1; j<=(2*n); j++)        {            // Left part of pattern            if (i<j)                printf(" ");            else                printf("*");                         // Right part of pattern            if (i<=((2*n)-j))                printf(" ");            else                printf("*");        }        printf("\n");    }         // This is lower half of pattern    for (i=1; i<=n; i++)    {        for (j=1;j<=(2*n);j++)        {            // Left part of pattern            if (i>(n-j+1))                printf(" ");            else                printf("*");                             // Right part of pattern            if ((i+n)>j)                printf(" ");            else                printf("*");        }        printf("\n");    }} // Driver Codeint main(){    pattern(7);    return 0;}
// Java program to print the// given pattern import java.io.*; class GFG {     static void pattern(int n)    {        int i, j;         // This is upper half of pattern        for (i = 1; i <= n; i++) {            for (j = 1; j <= (2 * n); j++) {                                 // Left part of pattern                if (i < j)                    System.out.print(" ");                else                    System.out.print("*");                 // Right part of pattern                if (i <= ((2 * n) - j))                    System.out.print(" ");                else                    System.out.print("*");            }                         System.out.println("");        }         // This is lower half of pattern        for (i = 1; i <= n; i++) {            for (j = 1; j <= (2 * n); j++) {                                 // Left part of pattern                if (i > (n - j + 1))                    System.out.print(" ");                else                    System.out.print("*");                 // Right part of pattern                if ((i + n) > j)                    System.out.print(" ");                else                    System.out.print("*");            }                         System.out.println("");        }    }     // Driver Code    public static void main(String[] args)    {        pattern(7);    }} // This code is contributed by vt_m
# Python3 program to# print the given pattern def pattern(n):         # This is upper    # half of pattern    for i in range(1, n + 1):        for j in range(1, 2 * n + 1):                         # Left part of pattern            if (i < j):                print("", end = " ");            else:                print("*", end = "");                             # Right part of pattern            if (i <= ((2 * n) - j)):                print("", end = " ");            else:                print("*", end = "");        print("");         # This is lower    # half of pattern    for i in range(1, n + 1):        for j in range(1, 2 * n + 1):                         # Left part of pattern            if (i > (n - j + 1)):                print("", end = " ");            else:                print("*", end = "");                         # Right part of pattern            if ((i + n) > j):                print("", end = " ");            else:                print("*", end = "");        print(""); # Driver Codepattern(7); # This code is contributed# by mits
// C# program to print// the given patternusing System; class GFG{    static void pattern(int n)    {        int i, j;         // This is upper        // half of pattern        for (i = 1; i <= n; i++)        {            for (j = 1; j <= (2 * n); j++)            {                                 // Left part of pattern                if (i < j)                    Console.Write(" ");                else                    Console.Write("*");                 // Right part of pattern                if (i <= ((2 * n) - j))                    Console.Write(" ");                else                    Console.Write("*");            }                         Console.WriteLine("");        }         // This is lower        // half of pattern        for (i = 1; i <= n; i++)        {            for (j = 1; j <= (2 * n); j++)            {                                 // Left part of pattern                if (i > (n - j + 1))                    Console.Write(" ");                else                    Console.Write("*");                 // Right part of pattern                if ((i + n) > j)                    Console.Write(" ");                else                    Console.Write("*");            }                         Console.WriteLine("");        }    }     // Driver Code    static public void Main ()    {        pattern(7);    }} // This code is contributed by ajit
<?php// PHP program to print// the given patternfunction pattern($n){    $i; $j;         // This is upper half    // of pattern    for ($i = 1; $i <= $n; $i++)    {        for ($j = 1; $j <= (2 * $n); $j++)        {            // Left part of pattern            if ($i < $j)                echo " ";            else                echo "*";                         // Right part of pattern            if ($i <= ((2 * $n) - $j))                echo " ";            else                echo "*";        }        echo "\n";    }         // This is lower half of pattern    for ($i = 1; $i <= $n; $i++)    {        for ($j = 1;$j <= (2 * $n); $j++)        {            // Left part of pattern            if ($i > ($n - $j + 1))                echo " ";            else                echo "*";                             // Right part of pattern            if (($i + $n) > $j)                echo " ";            else                echo "*";        }    echo "\n";    }} // Driver Codepattern(7); // This code is contributed by aj_36?>
<script> // Javascript program to print the// given pattern  function pattern(n){    var i, j;         // This is upper half of pattern    for(i = 1; i <= n; i++)    {        for(j = 1; j <= (2 * n); j++)        {                         // Left part of pattern            if (i < j)                document.write("  ");            else                document.write("*");                 // Right part of pattern            if (i <= ((2 * n) - j))                document.write("  ");            else                document.write("*");        }        document.write('<br>');    }         // This is lower half of pattern    for(i = 1; i <= n; i++)    {        for(j = 1; j <= (2 * n); j++)        {                         // Left part of pattern            if (i > (n - j + 1))                document.write("  ");            else                document.write("*");                 // Right part of pattern            if ((i + n) > j)                document.write("  ");            else                document.write("*");        }        document.write('<br>');    }} // Driver Codepattern(7); // This code is contributed by Princi Singh </script>
Output : 
*                          *
* *                      * *
* * *                  * * *
* * * *              * * * *
* * * * *          * * * * *
* * * * * *      * * * * * *
* * * * * * *  * * * * * * *
* * * * * * *  * * * * * * *
* * * * * *      * * * * * *
* * * * *          * * * * *
* * * *              * * * *
* * *                  * * *
* *                      * *
*                          *
This article is contributed by Aditya Kumar. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. 
jit_t
Mithun Kumar
akashmehrotra29
bunnyram19
shivanisinghss2110
rdtank
princi singh
pattern-printing
C Language
School Programming
pattern-printing
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Comments
Old Comments
fork() in C
Command line arguments in C/C++
Substring in C++
Function Pointer in C
Different methods to reverse a string in C/C++
Python Dictionary
Reverse a string in Java
Inheritance in C++
Constructors in C++
C++ Classes and Objects