C++ Program - Print Floyd's Triangle
Floyd's triangle is named after Robert Floyd and it is a right-angled triangular array of natural numbers. It is created by filling the rows of the triangle with consecutive natural numbers, starting with 1 at the top.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Example:
In the example below, a function called FloydTriangle is defined. It requires one parameter to pass as number of rows in the triangle and prints the given number of rows of Floyd's triangle.
#include <iostream> using namespace std; //function for floyd triangle void FloydTriangle(int n){ int value = 1; for(int i = 1; i <= n; i++) { for(int j = 1; j <= i; j++) { cout<<value<<" "; value++; } cout<<"\n"; } } int main (){ FloydTriangle(7); return 0; }
The above code will give the following output:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
Recommended Pages
- C++ Program - To Check Prime Number
- C++ Program - Bubble Sort
- C++ Program - Selection Sort
- C++ Program - Maximum Subarray Sum
- C++ Program - Reverse digits of a given Integer
- C++ - Swap two numbers
- C++ Program - Fibonacci Sequence
- C++ Program - Insertion Sort
- C++ Program - Find Factorial of a Number
- C++ Program - Find HCF of Two Numbers
- C++ Program - Merge Sort
- C++ Program - Shell Sort
- Stack in C++
- Queue in C++
- C++ Program - Find LCM of Two Numbers
- C++ Program - To Check Whether a Number is Palindrome or Not
- C++ Program - To Check Whether a String is Palindrome or Not
- C++ Program - Heap Sort
- C++ Program - Quick Sort
- C++ - Swap Two Numbers without using Temporary Variable