New: 77 pattern programs with tested code in C, C++, Java and Python Explore patterns

Alphabet Triangle

Read summary with AI tools
Table of contents
  1. Output
  2. How the alphabet triangle works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Related patterns

Instead of a fixed word, each row prints the alphabet from A up to the i-th letter. The logic is explained step by step, and the full program is given in C, C++, Java and Python.

This program is part of the String Patterns collection.

Alphabet Triangle output

Output (n = 5):

A
A B
A B C
A B C D
A B C D E
Alphabet Triangle layout diagram, row by row (n = 5)
How each row of the alphabet triangle is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the alphabet triangle works

Letters are consecutive character codes, so 'A' + j − 1 gives the j-th letter of the alphabet (in Python, chr(ord('A') + j − 1)).

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Print i letters of the alphabet.
  3. Move to the next line.

Alphabet 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("%c ", 'A' + j - 1);
        printf("\n");
    }
    return 0;
}

Alphabet Triangle in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            cout << char('A' + j - 1) << " ";
        cout << endl;
    }
    return 0;
}

Alphabet Triangle in Java

public class AlphabetTriangle {
    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.print((char) ('A' + j - 1) + " ");
            System.out.println();
        }
    }
}

Alphabet Triangle in Python

n = 5

for i in range(1, n + 1):
    for j in range(1, i + 1):
        print(chr(ord('A') + j - 1), 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).

Authored by

Ghanendra Yadav runs Pattern Programs from Bangalore, India. The site started in 2020 to help students practise loops and logic through pattern programs in C, C++, Java and Python. Every program published here is compiled and run before it goes live, and the output shown is the real output.

Latest articles

Leave a comment

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.