C program to print mirrored right triangle star pattern
*
**
***
****
*****
C Programming Language / Loop control in C Language
1525Program:
/** * C program to print mirrored right triangle star pattern series * atnyla.com */ #include int main() { int i, j, rows; /* Input rows from user */ printf("Enter number of rows: "); scanf("%d", &rows); /* Iterate through rows */ for(i=1; i<=rows; i++) { /* Print spaces in decreasing order of row */ for(j=i; j
Output:
Enter number of rows: 5 * ** *** **** *****
Explanation:
Required knowledge
Basic C programming, For loop, Nested loop
Logic to print mirrored right triangle star pattern
* ** *** **** *****
The above pattern is similar to right triangle star pattern with leading spaces.
Leading spaces in the above pattern are in decreasing order i.e. first row contains n-1
space, second contains n-2
space and so on. Point your mouse cursor over the pattern to count total spaces per row.
Step by step descriptive logic to print mirrored right triangle star pattern.
- Input number of rows to print from user. Store it in some variable say rows.
- To iterate through rows run an inner loop from 1 to rows. The loop structure should look like
for(i=1; i<=rows; i++)
. - To print spaces, run an inner loop from i to rows with loop structure
for(j=i;j<=rows;j++)
. Inside this loop print single space. - To print stars run another inner loop from 1 to i, with loop structure
for(j=1; j<=i; j++)
. - After printing all columns of a row, move to next line i.e. print new line.
Another way to solve the above program
/* * C program to print right triangle star pattern series * atnyla.com */ #include int main() { int i, j, n; /* Input number of rows from user */ printf("Enter value of n: "); scanf("%d", &n); for(i=1; i <= n; i++) { /* Print i number of stars */ for(j=1; j <= n; j++) { if( j >= n+1-i ) printf("*"); else printf(" "); } /* Move to next line */ printf("\n"); } return 0; }
This Particular section is dedicated to Programs only. If you want learn more about C Programming Language. Then you can visit below links to get more depth on this subject.