Consecutive natural numbers filled row by row into a right-angled triangle. This tutorial shows the output, a row-by-row diagram and the complete program in C, C++, Java and Python.
This program is part of the Series Patterns collection.
Floyd’s Triangle output
Output (n = 5):
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

How the floyd’s triangle works
Rows before row i contain i(i − 1)/2 numbers in total, so the value at row i, column j is i(i − 1)/2 + j.
- Run the outer loop for
ifrom1ton, one row per pass. - Print
inumbers (valuei × (i − 1) / 2 + j). - Move to the next line.
Floyd’s Triangle in C
#include <stdio.h>
int main(void) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++)
printf("%3d", i * (i - 1) / 2 + j);
printf("\n");
}
return 0;
}Floyd’s Triangle in C++
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++)
cout << setw(3) << i * (i - 1) / 2 + j;
cout << endl;
}
return 0;
}Floyd’s Triangle in Java
public class FloydsTriangle {
public static void main(String[] args) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++)
System.out.printf("%3d", i * (i - 1) / 2 + j);
System.out.println();
}
}
}Floyd’s Triangle in Python
n = 5
for i in range(1, n + 1):
for j in range(1, i + 1):
print(f"{i * (i - 1) // 2 + j:3d}", end="")
print()Time and space complexity
The program prints one character for each position in the pattern, so for n rows it runs in O(n²) time. It only needs a few loop variables, so the extra memory is O(1).





