FOR FREE YEAR SOLVED
Hollow Number Pyramid
Back to ProgrammingDescription
Hollow Number Pyramid:
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. the stars are printed on the boundary line which makes the pattern hollow.
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
If i=1 or i=n or j=1 or j=i then
Print j
Else
Print “ “
[End of ‘if’]
[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
{ if(i==1||j==1||i==n||j==i)
printf(" %d ",j);
else
printf(" ");
}
printf("\n"); }
The complexity is: O(n*(n-i+i))=O()
Related
Contributed by
