Programs to print Interesting Patterns
Last Updated :
18 Apr, 2023
Program to print the following pattern:
Examples :
Input : 5
Output:
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *
* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
This program is divided into four parts.
C++
#include<iostream>
using namespace std;
void pattern( int n)
{
int i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i > (n - j + 1))
cout << " " ;
else
cout << "*" ;
if ((i + n) > j)
cout << " " ;
else
cout << "*" ;
}
cout << endl ;
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i < j)
cout << " " ;
else
cout << "*" ;
if (i <= ((2 * n) - j))
cout << " " ;
else
cout << "*" ;
}
cout << endl;
}
}
int main()
{
pattern(7);
return 0;
}
|
C
#include<stdio.h>
void pattern( int n)
{
int i,j;
for (i=1; i<=n; i++)
{
for (j=1; j<=(2*n); j++)
{
if (i>(n-j+1))
printf ( " " );
else
printf ( "*" );
if ((i+n)>j)
printf ( " " );
else
printf ( "*" );
}
printf ( "\n" );
}
for (i=1; i<=n; i++)
{
for (j=1; j<=(2*n); j++)
{
if (i<j)
printf ( " " );
else
printf ( "*" );
if (i<=((2*n)-j))
printf ( " " );
else
printf ( "*" );
}
printf ( "\n" );
}
}
int main()
{
pattern(7);
return 0;
}
|
Java
import java.io.*;
class GFG {
static void pattern( int n)
{
int i, j;
for (i = 1 ; i <= n; i++) {
for (j = 1 ; j <= ( 2 * n); j++) {
if (i > (n - j + 1 ))
System.out.print( " " );
else
System.out.print( "*" );
if ((i + n) > j)
System.out.print( " " );
else
System.out.print( "*" );
}
System.out.println( "" );
}
for (i = 1 ; i <= n; i++) {
for (j = 1 ; j <= ( 2 * n); j++) {
if (i < j)
System.out.print( " " );
else
System.out.print( "*" );
if (i <= (( 2 * n) - j))
System.out.print( " " );
else
System.out.print( "*" );
}
System.out.println( "" );
}
}
public static void main(String[] args)
{
pattern( 7 );
}
}
|
Python3
def pattern(n):
for i in range ( 1 , n + 1 ):
for j in range ( 1 , 2 * n):
if i > (n - j + 1 ):
print ("", end = ' ' );
else :
print ( "*" , end = '');
if i + n - 1 > j:
print ("", end = ' ' );
else :
print ( "*" , end = '');
print ("");
for i in range ( 1 , n + 1 ):
for j in range ( 1 , 2 * n):
if i < j:
print ("", end = ' ' );
else :
print ( "*" , end = '');
if i < 2 * n - j:
print ("", end = ' ' );
else :
print ( "*" , end = '');
print ("");
pattern( 7 );
|
C#
using System;
class GFG
{
static void pattern( int n)
{
int i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i > (n - j + 1))
Console.Write( " " );
else
Console.Write( "*" );
if ((i + n) > j)
Console.Write( " " );
else
Console.Write( "*" );
}
Console.WriteLine( "" );
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i < j)
Console.Write( " " );
else
Console.Write( "*" );
if (i <= ((2 * n) - j))
Console.Write( " " );
else
Console.Write( "*" );
}
Console.WriteLine( "" );
}
}
static public void Main ()
{
pattern(7);
}
}
|
PHP
<?php
function pattern( $n )
{
$i ; $j ;
for ( $i = 1; $i <= $n ; $i ++)
{
for ( $j = 1; $j <= (2 * $n ); $j ++)
{
if ( $i > ( $n - $j + 1))
echo " " ;
else
echo "*" ;
if (( $i + $n ) > $j )
echo " " ;
else
echo "*" ;
}
printf( "\n" );
}
for ( $i = 1; $i <= $n ; $i ++)
{
for ( $j = 1; $j <= (2 * $n ); $j ++)
{
if ( $i < $j )
echo " " ;
else
echo "*" ;
if ( $i <= ((2 * $n ) - $j ))
echo " " ;
else
echo "*" ;
}
echo "\n" ;
}
}
pattern(7);
?>
|
Javascript
<script>
function pattern(n) {
var i, j;
for (i = 1; i <= n; i++) {
for (j = 1; j <= 2 * n; j++) {
if (i > n - j + 1)
document.write( " " );
else
document.write( "*" );
if (i + n > j)
document.write( " " );
else
document.write( "*" );
}
document.write( "<br>" );
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= 2 * n; j++) {
if (i < j)
document.write( " " );
else
document.write( "*" );
if (i <= 2 * n - j)
document.write( " " );
else
document.write( "*" );
}
document.write( "<br>" );
}
}
pattern(7);
</script>
|
Output
* * * * * * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *
* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * * * * * *
Time Complexity: O(n2)
Auxiliary Space: O(1)
Program to print following pattern:
Examples :
Input : 5
Output:
* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *
This program is divided into four parts.
C++
#include <bits/stdc++.h>
using namespace std;
void pattern( int n)
{
int i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i < j)
cout << " " ;
else
cout << "*" ;
if (i <= ((2 * n) - j))
cout << " " ;
else
cout << "*" ;
}
cout << "\n" ;
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i > (n - j + 1))
cout << " " ;
else
cout << "*" ;
if ((i + n) > j)
cout << " " ;
else
cout << "*" ;
}
cout << "\n" ;
}
}
int main()
{
pattern(7);
return 0;
}
|
C
#include<stdio.h>
void pattern( int n)
{
int i,j;
for (i=1; i<=n; i++)
{
for (j=1; j<=(2*n); j++)
{
if (i<j)
printf ( " " );
else
printf ( "*" );
if (i<=((2*n)-j))
printf ( " " );
else
printf ( "*" );
}
printf ( "\n" );
}
for (i=1; i<=n; i++)
{
for (j=1;j<=(2*n);j++)
{
if (i>(n-j+1))
printf ( " " );
else
printf ( "*" );
if ((i+n)>j)
printf ( " " );
else
printf ( "*" );
}
printf ( "\n" );
}
}
int main()
{
pattern(7);
return 0;
}
|
Java
import java.io.*;
class GFG {
static void pattern( int n)
{
int i, j;
for (i = 1 ; i <= n; i++) {
for (j = 1 ; j <= ( 2 * n); j++) {
if (i < j)
System.out.print( " " );
else
System.out.print( "*" );
if (i <= (( 2 * n) - j))
System.out.print( " " );
else
System.out.print( "*" );
}
System.out.println( "" );
}
for (i = 1 ; i <= n; i++) {
for (j = 1 ; j <= ( 2 * n); j++) {
if (i > (n - j + 1 ))
System.out.print( " " );
else
System.out.print( "*" );
if ((i + n) > j)
System.out.print( " " );
else
System.out.print( "*" );
}
System.out.println( "" );
}
}
public static void main(String[] args)
{
pattern( 7 );
}
}
|
Python3
def pattern(n):
for i in range ( 1 , n + 1 ):
for j in range ( 1 , 2 * n + 1 ):
if (i < j):
print (" ", end = " ");
else :
print ( "*" , end = "");
if (i < = (( 2 * n) - j)):
print (" ", end = " ");
else :
print ( "*" , end = "");
print ("");
for i in range ( 1 , n + 1 ):
for j in range ( 1 , 2 * n + 1 ):
if (i > (n - j + 1 )):
print (" ", end = " ");
else :
print ( "*" , end = "");
if ((i + n) > j):
print (" ", end = " ");
else :
print ( "*" , end = "");
print ("");
pattern( 7 );
|
C#
using System;
class GFG
{
static void pattern( int n)
{
int i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i < j)
Console.Write( " " );
else
Console.Write( "*" );
if (i <= ((2 * n) - j))
Console.Write( " " );
else
Console.Write( "*" );
}
Console.WriteLine( "" );
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i > (n - j + 1))
Console.Write( " " );
else
Console.Write( "*" );
if ((i + n) > j)
Console.Write( " " );
else
Console.Write( "*" );
}
Console.WriteLine( "" );
}
}
static public void Main ()
{
pattern(7);
}
}
|
PHP
<?php
function pattern( $n )
{
$i ; $j ;
for ( $i = 1; $i <= $n ; $i ++)
{
for ( $j = 1; $j <= (2 * $n ); $j ++)
{
if ( $i < $j )
echo " " ;
else
echo "*" ;
if ( $i <= ((2 * $n ) - $j ))
echo " " ;
else
echo "*" ;
}
echo "\n" ;
}
for ( $i = 1; $i <= $n ; $i ++)
{
for ( $j = 1; $j <= (2 * $n ); $j ++)
{
if ( $i > ( $n - $j + 1))
echo " " ;
else
echo "*" ;
if (( $i + $n ) > $j )
echo " " ;
else
echo "*" ;
}
echo "\n" ;
}
}
pattern(7);
?>
|
Javascript
<script>
function pattern(n)
{
var i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i < j)
document.write( " " );
else
document.write( "*" );
if (i <= ((2 * n) - j))
document.write( " " );
else
document.write( "*" );
}
document.write( '<br>' );
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= (2 * n); j++)
{
if (i > (n - j + 1))
document.write( " " );
else
document.write( "*" );
if ((i + n) > j)
document.write( " " );
else
document.write( "*" );
}
document.write( '<br>' );
}
}
pattern(7);
</script>
|
Output
* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * * * * * *
* * * * * * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *
Time Complexity: O(n2)
Auxiliary Space: O(1)
Program to print the following pattern:
Examples:
Input : 9 [For Odd number]
Output:
\*******/
*\*****/*
**\***/**
***\*/***
****/****
***/*\***
**/***\**
*/*****\*
/*******\
Input : 8 [For Even number]
Output :
\******/
*\****/*
**\**/**
***\/***
***/\***
**/**\**
*/****\*
/******\
Code implementation to print the given pattern:
C++
#include <bits/stdc++.h>
using namespace std;
void pattern( int n)
{
for ( int i = 1; i <= n; i++) {
for ( int j = 1; j <= n; j++) {
if (i == j || i + j == (n + 1)) {
if (i + j == (n + 1)) {
cout << "/" ;
}
else {
cout << "\\" ;
}
}
else
cout << "*" ;
}
cout << endl;
}
}
int main()
{
pattern(9);
return 0;
}
|
Java
import java.io.*;
class pattern
{
static void pattern( int n)
{
for ( int i = 1 ; i <= n; i++)
{
for ( int j = 1 ; j <= n; j++)
{
if (i == j || i + j == (n + 1 )) {
if (i + j == (n + 1 )) {
System.out.print( "/" );
}
else {
System.out.print( "\\" );
}
}
else
System.out.print( "*" );
}
System.out.println();
}
}
public static void main(String[] args)
{
pattern( 9 );
}
}
|
Python3
def pattern(n):
for i in range ( 1 , n + 1 ):
for j in range ( 1 , n + 1 ):
if i = = j or i + j = = n + 1 :
if i + j = = (n + 1 ):
print ( '/' , end = '')
else :
print ( '\\', end = ' ')
else :
print ( '*' , end = '')
print ('')
if __name__ = = '__main__' :
n = 8
pattern(n)
|
C#
using System;
using System.Collections.Generic;
class GFG
{
static void pattern( int n)
{
for ( int i = 1; i <= n; i++)
{
for ( int j = 1; j <= n; j++)
{
if (i == j || i + j == (n + 1)) {
if (i + j == (n + 1)) {
Console.Write( "/" );
}
else {
Console.Write( "\\" );
}
}
else
Console.Write( "*" );
}
Console.Write( "\n" );
}
}
static void Main( string [] args)
{
pattern(9);
}
}
|
Javascript
<script>
function pattern(n)
{
for (let i = 1; i <= n; i++)
{
for (let j = 1; j <= n; j++)
{
if (i == j || i + j == (n + 1)) {
if (i + j == (n + 1)) {
document.write( "/" );
}
else {
document.write( "\\" );
}
}
else
document.write( "*" );
}
document.write( "<br>" );
}
}
pattern(9);
</script>
|
Output
\*******/
*\*****/*
**\***/**
***\*/***
****/****
***/*\***
**/***\**
*/*****\*
/*******\
Time Complexity: O(n2)
Auxiliary Space: O(1)
Program to print the following pattern:
Examples :
Input : 8
Output :
7 6 5 4 3 2 1 0
6 5 4 3 2 1 0
5 4 3 2 1 0
4 3 2 1 0
3 2 1 0
2 1 0
1 0
0
Code implementation to print the given pattern:
C++
#include <bits/stdc++.h>
using namespace std;
void pattern( int n)
{
for ( int i = 1; i <= n; i++) {
int k = n - i;
for ( int j = 1; j <= n; j++) {
if (j <= (n + 1) - i) {
cout << k << " " ;
k--;
}
else {
cout << " " ;
}
}
cout << endl;
}
}
int main()
{
pattern(8);
return 0;
}
|
Java
import java.util.*;
public class Main {
public static void pattern( int n) {
for ( int i = 1 ; i <= n; i++) {
int k = n - i;
for ( int j = 1 ; j <= n; j++) {
if (j <= (n + 1 ) - i) {
System.out.print(k + " " );
k--;
}
else {
System.out.print( " " );
}
}
System.out.println();
}
}
public static void main(String args[]) {
pattern( 8 );
}
}
|
Python3
def pattern(n):
for i in range ( 1 , n + 1 ):
for j in range (n - i, - 1 , - 1 ):
print (j, end = ' ' )
print ()
if __name__ = = '__main__' :
n = 8
pattern(n)
|
C#
using System;
using System.Collections.Generic;
class GFG
{
static void pattern( int n)
{
for ( int i = 1; i <= n; i++) {
int k = n - i;
for ( int j = 1; j <= n; j++) {
if (j <= (n + 1) - i) {
Console.Write(k + " " );
k--;
}
else {
Console.Write( " " );
}
}
Console.WriteLine();
}
}
static void Main( string [] args)
{
pattern(8);
}
}
|
Javascript
function pattern(n) {
for (let i = 1; i <= n; i++) {
let k = n - i;
for (let j = 1; j <= n; j++) {
if (j <= n + 1 - i) {
console.log(k + " " );
k--;
}
else {
console.log( " " );
}
}
console.log( "<br>" );
}
}
pattern(8);
|
Output
7 6 5 4 3 2 1 0
6 5 4 3 2 1 0
5 4 3 2 1 0
4 3 2 1 0
3 2 1 0
2 1 0
1 0
0
Time Complexity: O(n2)
Auxiliary Space: O(1)
Program to print the following pattern :
Examples:
Input: 7
Output:
1
8 2
14 9 3
19 15 10 4
23 20 16 11 5
26 24 21 17 12 6
28 27 25 22 18 13 7
Code implementation to print the given pattern:
C++
#include <bits/stdc++.h>
using namespace std;
void pattern( int n)
{
int p, k = 1;
for ( int i = 1; i <= n; i++) {
p = k;
for ( int j = 1; j <= i; j++) {
cout << p << " " ;
p = p - (n - i + j);
}
cout << endl;
k = k + 1 + (n - i);
}
}
int main()
{
pattern(7);
return 0;
}
|
Java
public class Pattern {
public static void pattern( int n)
{
int p, k = 1 ;
for ( int i = 1 ; i <= n; i++) {
p = k;
for ( int j = 1 ; j <= i; j++) {
System.out.print(p + " " );
p = p - (n - i + j);
}
System.out.println();
k = k + 1 + (n - i);
}
}
public static void main(String[] args)
{
pattern( 7 );
}
}
|
Python3
def pattern(n):
k = 1
for i in range ( 1 , n + 1 ):
p = k
for j in range ( 1 ,i + 1 ):
print (p, end = ' ' )
p = p - (n - i + j)
print ()
k = k + 1 + (n - i)
if __name__ = = '__main__' :
n = 7
pattern(n)
|
C#
using System;
namespace Pattern
{
class Program
{
static void Pattern( int n)
{
int p, k = 1;
for ( int i = 1; i <= n; i++)
{
p = k;
for ( int j = 1; j <= i; j++)
{
Console.Write(p + " " );
p = p - (n - i + j);
}
Console.WriteLine();
k = k + 1 + (n - i);
}
}
static void Main( string [] args)
{
Pattern(7);
}
}
}
|
Javascript
<script>
function pattern(n) {
let k = 1;
for (let i = 1; i <= n; i++) {
let p = k;
for (let j = 1; j <= i; j++) {
document.write(p + " " );
p = p - (n - i + j);
}
document.write( "<br>" );
k = k + 1 + (n - i);
}
}
pattern(7);
</script>
|
Output
1
8 2
14 9 3
19 15 10 4
23 20 16 11 5
26 24 21 17 12 6
28 27 25 22 18 13 7
Time Complexity: O(n2)
Auxiliary Space: O(1)
Share your thoughts in the comments
Please Login to comment...