Program to print a inverse pyramid character pattern
Given a positive integer n, print the inverse pyramid pattern upto n rows as shown in the examples.
Examples :
Input : 4
Output :
A B C D D C B A
A B C C B A
A B B A
A A
Input : 6
Output :
A B C D E F F E D C B A
A B C D E E D C B A
A B C D D C B A
A B C C B A
A B B A
A A
Below is the implementation for the pattern:
C++
#include <bits/stdc++.h>
using namespace std;
void pyramid( int n)
{
int i, j, num, gap;
for (i = n; i >= 1; i--) {
for (gap = n - 1; gap >= i; gap--) {
cout<< " " ;
cout<< " " ;
}
num = 'A' ;
for (j = 1; j <= i; j++) {
cout << ( char ) num++ << " " ;
}
for (j = i - 1; j >= 0; j--) {
cout << ( char ) --num << " " ;
}
cout<< "\n" ;
}
}
int main()
{
int n = 9;
pyramid(n);
return 0;
}
|
Java
import java.util.*;
class GFG {
static void pyramid( int n)
{
int i, j, num, gap;
for (i = n; i >= 1 ; i--) {
for (gap = n - 1 ; gap >= i; gap--) {
System.out.print( " " );
System.out.print( " " );
}
num = 'A' ;
for (j = 1 ; j <= i; j++) {
System.out.print(( char )num++ + " " );
}
for (j = i - 1 ; j >= 0 ; j--) {
System.out.print(( char )--num + " " );
}
System.out.println( "" );
}
}
public static void main(String[] args)
{
int n = 9 ;
pyramid(n);
}
}
|
Python3
def pyramid( n ):
for i in range (n, 0 , - 1 ):
for gap in range (n - 1 , i - 1 , - 1 ):
print ( " " , end = '')
print ( " " , end = '')
num = ord ( 'A' )
for j in range ( 1 , i + 1 ):
print ( chr (num), end = ' ' )
num + = 1
for j in range (i - 1 , - 1 , - 1 ):
num - = 1
print ( chr (num), end = ' ' )
print ( "\n" , end = '')
n = 9
pyramid(n)
|
C#
using System;
class GFG {
static void pyramid( int n)
{
int i, j, num, gap;
for (i = n; i >= 1; i--) {
for (gap = n - 1; gap >= i; gap--) {
Console.Write( " " );
Console.Write( " " );
}
num = 'A' ;
for (j = 1; j <= i; j++) {
Console.Write(( char )num++ + " " );
}
for (j = i - 1; j >= 0; j--) {
Console.Write(( char )--num + " " );
}
Console.WriteLine( "" );
}
}
public static void Main()
{
int n = 9;
pyramid(n);
}
}
|
PHP
<?php
function pyramid( $n )
{
for ( $i = $n ; $i >= 1; $i --)
{
for ( $gap = $n - 1; $gap >= $i ;
$gap --)
{
echo " " ;
}
$num = 65;
for ( $j = 1; $j <= $i ; $j ++)
{
echo chr ( $num ++). " " ;
}
for ( $j = $i - 1; $j >= 0; $j --)
{
echo chr (-- $num ). " " ;
}
echo "\n" ;
}
}
$n = 9;
pyramid( $n );
?>
|
Javascript
<script>
function pyramid(n)
{
var i, j, num, gap;
for (i = n; i >= 1; i--) {
for (gap = n - 1; gap >= i; gap--) {
document.write( " " );
}
num = "A" .charCodeAt(0);
for (j = 1; j <= i; j++) {
document.write(String.fromCharCode(num++)
+ " " );
}
for (j = i - 1; j >= 0; j--) {
document.write(String.fromCharCode(--num)
+ " " );
}
document.write( "<br>" );
}
}
var n = 9;
pyramid(n);
</script>
|
Output
A B C D E F G H I I H G F E D C B A
A B C D E F G H H G F E D C B A
A B C D E F G G F E D C B A
A B C D E F F E D C B A
A B C D E E D C B A
A B C D D C B A
A B C C B A
A B B A
A A
Time Complexity: O(n2), where n represents the given input.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Last Updated :
20 Feb, 2023
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...