Program for Stair Case Patterns
Last Updated :
20 Feb, 2023
Programs to print following pattern.
Examples:
Input : 6
Output :
* *
* *
* * * *
* * * *
* * * * * *
* * * * * *
C++
#include <iostream>
using namespace std;
void pattern( int n)
{
for ( int i = 1; i <= n; i++) {
int k = (i % 2 != 0) ? i + 1 : i;
for ( int j = 0; j < k; j++)
cout << " * " ;
cout << endl;
}
}
int main()
{
int n = 6;
pattern(n);
return 0;
}
|
Java
import java.io.*;
class GFG {
static void pattern( int n)
{
for ( int i = 1 ; i <= n; i++) {
int k ;
if (i % 2 != 0 )
k = i + 1 ;
else
k = i ;
for ( int j = 0 ; j < k; j++)
System.out.print( " * " );
System.out.println();
}
}
public static void main(String args[])
{
int n = 6 ;
pattern(n);
}
}
|
Python3
def pattern(n):
for i in range ( 1 , n + 1 ):
k = i + 1 if (i % 2 ! = 0 ) else i
for j in range ( 0 , k):
if j = = k - 1 :
print ( " * " )
else :
print ( " * " , end = " " )
n = 6
pattern(n)
|
C#
using System;
class GFG {
static void pattern( int n)
{
for ( int i = 1; i <= n; i++) {
int k ;
if (i % 2 != 0)
k = i + 1 ;
else
k = i ;
for ( int j = 0; j < k; j++)
Console.Write( " * " );
Console.WriteLine();
}
}
public static void Main()
{
int n = 6;
pattern(n);
}
}
|
PHP
<?php
function pattern( $n )
{
for ( $i = 1; $i <= $n ; $i ++)
{
$k = ( $i % 2 != 0) ?
$i + 1 : $i ;
for ( $j = 0; $j < $k ; $j ++)
echo " * " ;
echo "\n" ;
}
}
$n = 6;
pattern( $n );
?>
|
Javascript
<script>
function pattern( n)
{
for ( i = 1; i <= n; i++) {
let k;
if (i % 2 != 0)
k = i + 1;
else
k = i;
for ( j = 0; j < k; j++)
document.write( " * " );
document.write( "<br/>" );
}
}
let n = 6;
pattern(n);
</script>
|
Output:
* *
* *
* * * *
* * * *
* * * * * *
* * * * * *
Program to print following pattern.
Examples:
Input : 6
Output :
* *
* *
* * * *
* * * *
* * * * * *
* * * * * *
C++
#include <iostream>
using namespace std;
void pattern( int n)
{
for ( int i = 1; i <= n; i++) {
int k = (i % 2 != 0) ? i + 1 : i;
for ( int g = n; g > k; g--)
cout << " " ;
for ( int j = 0; j < k; j++)
cout << "* " ;
cout << endl;
}
}
int main()
{
int n = 6;
pattern(n);
return 0;
}
|
Java
import java.io.*;
class GFG {
static void pattern( int n)
{
for ( int i = 1 ; i <= n; i++) {
int k;
if (i % 2 != 0 )
k = i + 1 ;
else
k = i;
for ( int g = n; g > k; g--)
System.out.print( " " );
for ( int j = 0 ; j < k; j++)
System.out.print( "* " );
System.out.println();
}
}
public static void main(String args[])
{
int n = 6 ;
pattern(n);
}
}
|
Python3
def pattern(n) :
for i in range ( 1 ,n + 1 ) :
if (i % 2 ! = 0 ) :
k = i + 1
else :
k = i
for g in range (n ,k, - 1 ) :
print ( " " ,end = "")
for j in range ( 0 , k):
print ( "* " ,end = "")
print ()
n = 6
pattern(n)
|
C#
using System;
class GFG
{
static void pattern( int n)
{
for ( int i = 1; i <= n; i++)
{
int k;
if (i % 2 != 0)
k = i + 1 ;
else
k = i;
for ( int g = n; g > k; g--)
Console.Write( " " );
for ( int j = 0; j < k; j++)
Console.Write( "* " );
Console.WriteLine();
}
}
public static void Main()
{
int n = 6;
pattern(n);
}
}
|
PHP
<?php
function pattern( $n )
{
for ( $i = 1; $i <= $n ; $i ++)
{
$k = ( $i % 2 != 0) ? $i + 1 : $i ;
for ( $g = $n ; $g > $k ; $g --)
echo " " ;
for ( $j = 0; $j < $k ; $j ++)
echo " *" ;
echo "\n" ;
}
}
$n = 6;
pattern( $n );
?>
|
Javascript
<script>
function pattern(n) {
for (i = 1; i <= n; i++) {
var k;
if (i % 2 != 0)
k = i + 1;
else
k = i;
for (g = n; g > k; g--)
document.write( " " );
for (j = 0; j < k; j++)
document.write( "* " );
document.write( "<br/>" );
}
}
var n = 6;
pattern(n);
</script>
|
Output:
* *
* *
* * * *
* * * *
* * * * * *
* * * * * *
Program to print following pattern.
Examples:
Input : 6
Output :
* * * * * *
* * * * * *
* * * *
* * * *
* *
* *
C++
#include <iostream>
using namespace std;
void pattern( int n)
{
for ( int i = n; i > 0; i--) {
int k = (i % 2 != 0) ? i + 1 : i;
for ( int j = 0; j < k; j++)
cout << " * " ;
cout << endl;
}
}
int main()
{
int n = 6;
pattern(n);
return 0;
}
|
Java
import java.io.*;
class GFG {
static void pattern( int n)
{
for ( int i = n; i > 0 ; i--) {
int k;
if (i % 2 != 0 )
k = i + 1 ;
else
k = i;
for ( int j = 0 ; j < k; j++)
System.out.print( " * " );
System.out.println();
}
}
public static void main(String args[])
{
int n = 6 ;
pattern(n);
}
}
|
Python 3
def pattern(n) :
for i in range (n, 0 , - 1 ) :
if (i % 2 ! = 0 ) :
k = i + 1
else :
k = i
for g in range (n, k) :
print ( " " ,end = "")
for j in range ( 0 , k) :
print ( " * " ,end = "")
print ()
n = 6
pattern(n)
|
C#
using System;
class GFG
{
static void pattern( int n)
{
for ( int i = n; i > 0; i--)
{
int k;
if (i % 2 != 0)
k = i + 1;
else
k = i;
for ( int j = 0; j < k; j++)
Console.Write( " * " );
Console.WriteLine();
}
}
public static void Main()
{
int n = 6;
pattern(n);
}
}
|
PHP
<?php
function pattern( $n )
{
for ( $i = $n ; $i > 0; $i --)
{
$k = ( $i % 2 != 0) ?
$i + 1 : $i ;
for ( $j = 0; $j < $k ; $j ++)
echo ( "* " );
echo ( "\n" );
}
}
$n = 6;
pattern( $n );
?>
|
Javascript
<script>
function pattern(n) {
for ( var i = n; i > 0; i--) {
var k;
if (i % 2 != 0)
k = i + 1;
else
k = i;
for ( var j = 0; j < k; j++)
document.write( " * " );
document.write( "<br/>" );
}
}
var n = 6;
pattern(n);
</script>
|
Output:
* * * * * *
* * * * * *
* * * *
* * * *
* *
* *
Program to print following pattern.
Examples:
Input : 6
Output :
* * * * * *
* * * * * *
* * * *
* * * *
* *
* *
C++
#include <iostream>
using namespace std;
void pattern( int n)
{
for ( int i = n; i > 0; i--)
{
int k = (i % 2 != 0) ?
i + 1 : i;
for ( int g = k; g < n; g++)
cout << " " ;
for ( int j = 0; j < k; j++)
cout << "* " ;
cout << endl;
}
}
int main()
{
int n = 6;
pattern(n);
return 0;
}
|
Java
import java.io.*;
class GFG
{
static void pattern( int n)
{
for ( int i = n; i > 0 ; i--)
{
int k = (i % 2 != 0 ) ?
i + 1 : i;
for ( int g = k; g < n; g++)
System.out.print( " " );
for ( int j = 0 ; j < k; j++)
System.out.print( "* " );
System.out.println();
}
}
public static void main(String args[])
{
int n = 6 ;
pattern(n);
}
}
|
Python3
def pattern(n) :
for i in range (n, 0 , - 1 ) :
if (i % 2 ! = 0 ) :
k = i + 1
else :
k = i
for g in range (k, n) :
print ( " " , end = "")
for j in range ( 0 ,k) :
print ( "* " , end = "")
print ()
n = 6
pattern(n)
|
C#
using System;
class GFG
{
static void pattern( int n)
{
for ( int i = n; i > 0; i--)
{
int k = (i % 2 != 0) ?
i + 1 : i;
for ( int g = k; g < n; g++)
Console.Write( " " );
for ( int j = 0; j < k; j++)
Console.Write( "* " );
Console.WriteLine();
}
}
public static void Main ()
{
int n = 6;
pattern(n);
}
}
|
PHP
<?php
function pattern( $n )
{
for ( $i = $n ; $i > 0; $i --)
{
$k = ( $i % 2 != 0) ?
$i + 1 : $i ;
for ( $g = $k ; $g < $n ; $g ++)
echo " " ;
for ( $j = 0; $j < $k ; $j ++)
echo "* " ;
echo "\n" ;
}
}
$n = 6;
pattern( $n );
?>
|
Javascript
<script>
function pattern(n)
{
for (i = n; i > 0; i--)
{
var k = (i % 2 != 0) ? i + 1 : i;
for (g = k; g < n; g++)
document.write( " " );
for (j = 0; j < k; j++)
document.write( "* " );
document.write( "<br/>" );
}
}
var n = 6;
pattern(n);
</script>
|
Output:
* * * * * *
* * * * * *
* * * *
* * * *
* *
* *
Time complexity: O(n^2) for given n
Auxiliary space: O(1)
Share your thoughts in the comments
Please Login to comment...