Java program: Print Mirrored Rhombus
Table of Contents
In this article, we will discuss the C++ program: Print Mirrored Rhombus pattern program
We can display many types of number, star, Alphabet, Binary patterns using for.while and do-while loop in C++ language
In this post, we are going to learn how to print Mirrored Rhombus Pattern using for, while and do-while loop in C++ language,
Note – Here,To create a Mirrored Rhombus pattern, you can use either star or any symbol as you wish
This program allows the user to enter the number of rows and any caracter or symbol then the program displays the Mirrored Rhombus pattern using for loop in C++ language
Program 1
#include <iostream>
#include <conio.h>
using namespace std;
int main() {
int i,j,rows;
char ch;
cout<<"Enter the number of rows\n";
cin>>rows;
cout<<"Enter the Symbol for pattern\n";
cin>>ch;
cout<<"\n";
for(i=1; i<=rows; i++){//outer for loop
for(j=1; j<=i; j++){//inner for loop
cout<<" ";//print space
}
for(j=1; j<=rows; j++){//inner for loop
cout<<ch;//print symbol after space
}
cout<<"\n";//move to next line
}
getch();
return 0;
}
When the above code is executed, it produces the following result
This program allows the user to enter the number of rows and any character or symbols then the program displays the Mirrored Rhombus pattern using while loop in C++ language
Program 1
#include <iostream>
#include <conio.h>
using namespace std;
int main() {
int i,j,rows;
char ch;
cout<<"Enter the number of rows\n";
cin>>rows;
cout<<"Enter the Symbol for pattern\n";
cin>>ch;
cout<<"\n";
i=1;
while(i<=rows){//outer while loop
j=1;
while(j<=i){//inner while loop
cout<<" ";//print space
j++;
}
j=1;
while(j<=rows){//inner while loop
cout<<ch;//print symbol after space
j++;
}
cout<<"\n";//move to next line
i++;
}
getch();
return 0;
}
When the above code is executed, it produces the following result
This program allows the user to enter the number of rows and any character or symbols then the program displays the Mirrored Rhombus pattern using do-while loop in C++ language
Program 1
#include <iostream>
#include <conio.h>
using namespace std;
int main() {
int i,j,rows;
char ch;
cout<<"Enter the number of rows\n";
cin>>rows;
cout<<"Enter the Symbol for pattern\n";
cin>>ch;
cout<<"\n";
i=1;
do{//outer do-while loop
j=1;
do{//inner do-while loop
cout<<" ";//print space
j++;
} while(j<=i);
j=1;
do{//inner do-while loop
cout<<ch;//print symbol after space
j++;
}while(j<=rows);
cout<<"\n";//move to next line
i++;
}while(i<=rows);
getch();
return 0;
}
When the above code is executed, it produces the following result
In this program, we can use star for create star rhombus pattern
Suggested for you
Similar post
C pyramid star pattern program – using loops
C++ pyramid star pattern program – using loops
Hollow Pyramid star pattern in C language
Hollow Pyramid star pattern in C++ language
Hollow reverse Pyramid pattern in C languag
Right triangle star pattern in Java language
Right triangle star pattern in C language
Right triangle star pattern in C++ language
Hollow Right triangle star pattern in Java language
Hollow Right triangle star pattern in C language
Hollow Right triangle star pattern in C++ language
Mirrored Right Triangle Star Pattern in Java language
Mirrored Right Triangle Star Pattern in C++ language
Mirrored Right Triangle Star Pattern in C language
Hollow inverted right triangle star pattern in java
Hollow inverted right triangle star pattern in C
Hollow inverted right triangle star pattern in C++
Rhombus pattern in Java language
Rhombus pattern in C++ language
Hollow Rhombus pattern in Java language
Multiply two numbers in Java using scanner| 5 different ways In this article, we will…
5 Different ways to Divide two numbers in Java using scanner In this article, we…
Learn 8 Ways to Subtract Two Numbers Using Methods in Java In this article, we…
10 ways to subtract two numbers in Java In this article, we will discuss the…
Java Code Examples – Multiply Two Numbers in 5 Easy Ways In this article, we…
How to Divide two numbers in Java| 5 different ways In this article, we will…
This website uses cookies.