Each number is the sum of the two numbers above it, and the edges are always 1. 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 Tricky Patterns collection.
Pascal’s Triangle output
Output (n = 5):
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1

How the pascal’s triangle works
The values in row i are the binomial coefficients C(i, j). Start each row with 1 and get the next value with value = value × (i − j) / (j + 1), which avoids computing factorials.
Pascal’s Triangle in C
#include <stdio.h>
int main(void) {
int n = 5;
for (int i = 0; i < n; i++) {
for (int k = 0; k < n - i - 1; k++)
printf(" ");
int value = 1;
for (int j = 0; j <= i; j++) {
printf("%d ", value);
value = value * (i - j) / (j + 1);
}
printf("\n");
}
return 0;
}Pascal’s Triangle in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
for (int i = 0; i < n; i++) {
for (int k = 0; k < n - i - 1; k++)
cout << " ";
int value = 1;
for (int j = 0; j <= i; j++) {
cout << value << " ";
value = value * (i - j) / (j + 1);
}
cout << endl;
}
return 0;
}Pascal’s Triangle in Java
public class PascalsTriangle {
public static void main(String[] args) {
int n = 5;
for (int i = 0; i < n; i++) {
for (int k = 0; k < n - i - 1; k++)
System.out.print(" ");
int value = 1;
for (int j = 0; j <= i; j++) {
System.out.print(value + " ");
value = value * (i - j) / (j + 1);
}
System.out.println();
}
}
}Pascal’s Triangle in Python
n = 5
for i in range(n):
print(" " * (n - i - 1), end="")
value = 1
for j in range(i + 1):
print(value, end=" ")
value = value * (i - j) // (j + 1)
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).





