FOR FREE MATERIALS

Pyramid Number Pattern Decreasing Order

Back to Programming

Description

Pyramid Number Pattern Decreasing Order:

Here in this pattern printing, the number of lines of the pattern is taken as the input. Three for loops are used to display the pattern. The first for loop (the outer for loop) is used to count the line number so the loop is from 1 to n. for ith line the value of i is printed for i times.

Algorithm

INPUT: the number of lines
OUTPUT: the aforesaid pattern
PROCESS:
Step 1: read n [the number of lines]
Step 2: for i=1 to n repeat
		For k=1 to n-i repeat
			Print “ “
		[End of ‘for’ loop]
		For j=1 to i repeat
			Print i
		[End of ‘for’ loop]
		Move to the next line
	[End of ‘for’ loop]
Step 3: stop.

Code

Time Complexity:

for(i=1;i<=n;i++)--------------------------------------- n

                {               for(k=1;k<=n-i;k++)------------------------- n-i

                                                printf(" ");

                                for(j=1;j<=i;j++)------------------------------- i

                                                printf("%d ",i);

                                printf("\n"); 

                }

The complexity is: O(n*(n-i+i))=O(n2)