Front-end Tutorials

Front-end Tutorials

HTMLCSSSassJavaScriptReactJS
CMS Tutorials

CMS Tutorials

WordPress
Tutorials expand

C++ Number Pattern 26

Posted in C++ Tutorial
Updated on Jan 10, 2024
By Mari Selvan
👁️ 88 - Views
⏳ 4 mins
💬 1 Comment
C++ Number Pattern 26

Photo Credit to CodeToFun

C++ Number Pattern 26

Here`s a program that prints the above number pattern using C++ Programming:

example.cpp
Copied
Copy To Clipboard
#include <iostream>
using namespace std;

int main() {
  int i, j;
  for (i = 1; i <= 5; i++) {
    for (j = 5; j >= 1; j--) {
      if (i == j)
        cout << "*";
      else
        cout << j;
    }
    cout << "\n";
  }
  return 0;
}

💻 Testing the Program

When you run the above program, it will print the following output:

Output
5432*
543*1
54*21
5*321
*4321

🧠 How the Program Works

Let's break down the logic behind the code:

  1. The program starts with the usual C++ header file inclusion for input/output operations (iostream).
  2. The using namespace std; line is included to allow using the standard C++ library elements without explicitly specifying the namespace each time.
  3. The main() function is the starting point of the program. It returns an integer value, and in this case, it returns 0 to indicate successful execution.
  4. Two integer variables i and j are declared to be used as loop counters.
  5. The outer loop for(i=1; i<=5; i++) runs five times, starting from i=1 and continuing as long as i is less than or equal to 5. It increments i by 1 in each iteration.
  6. Inside the outer loop, there is an inner loop for(j=5; j>=1; j--). The inner loop also runs five times, starting from j=5 and continuing as long as j is greater than or equal to 1. It decrements j by 1 in each iteration.
  7. In the inner loop, there is a conditional check if(i == j). This checks if the current values of i and j are equal. If they are equal, it means we are on the diagonal of a matrix-like pattern, and it prints an asterisk * using cout << "*";.
  8. If the condition in the if statement is not met (i.e., i is not equal to j), it prints the value of j using cout << j;.
  9. After completing the inner loop, there is a cout << "\n"; statement. This prints a newline character, which moves the output to the next line, creating the pattern.
  10. The outer loop continues, and the entire process is repeated five times, creating a matrix-like pattern with the numbers decreasing from 5 to 1 in each row and an asterisk * on the diagonal.

💯 Tips for Enhancement:

Explore the versatility of this pattern by adjusting its parameters. Whether you increase or decrease the size, tweak the spacing, or modify the characters used, each change opens up a world of possibilities, allowing you to customize and create your unique visual effects.

✔ Conclusion:

Creating visually appealing patterns is not only a fun endeavour but also a great way to enhance your programming or design skills. We hope this tutorial has inspired you to explore the world of creative coding. Share your creations with us, and let your imagination run wild!

🤗 Closing Call-to-Action:

We'd love to see your unique interpretations of the number pattern. Share your creations in the comments below, and don't hesitate to reach out if you have any questions or suggestions for future tutorials. Happy coding!

👨‍💻 Join our Community:

To get interesting news and instant updates on Front-End, Back-End, CMS and other Frameworks. Please Join the Telegram Channel:

Author

author
👋 Hey, I'm Mari Selvan

For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.

Buy me a coffee to make codetofun.com free for everyone.

Buy me a Coffee

Share Your Findings to All

Subscribe
Notify of
guest
1 Comment
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
Mari Selvan
Mari Selvan
11 months ago

If you have any doubts regarding this article (C++ Number Pattern 26) please comment here. I will help you immediately.

We make use of cookies to improve our user experience. By using this website, you agree with our Cookies Policy
AgreeCookie Policy