Ascending Number Triangle in C

Beginner
⏱️ 8 min read
📚 Updated: Aug 2026
🎯 3 Code Examples
🚀 Live Preview
Nested Loops
Ascending number triangle output (1, 12, 123, 1234, 12345) in C programming
Overview

What You’ll Learn

The ascending number triangle pattern grows one digit per row: nested loops, printf vs printf("\n"), and a clear visual result. This tutorial covers the shape rule, loop structure, a live preview, algorithm steps, worked C examples, edge cases, and complexity.

Shape Rule

1..i digits on row i

Row 1 prints 1, row 2 prints 12, growing until row rows prints 1..rows.

Outer Loop

Rows

for (i = 1; i <= rows; i++) walks each line from one digit up to the full width.

Inner Loop

Digits

for (j = 1; j <= i; j++) prints digits 1 through i on that row.

printf vs Newline

Same line / next line

Digits use printf("%d", j); end each row with printf("\n").

Live Preview

1–20 rows

Pick a row count and draw the ascending number triangle instantly in the browser.

O(n²)

Complexity

Total digit prints = n(n+1)/2; extra memory stays O(1).

Introduction

An ascending number triangle pattern starts with one digit on row 1 and grows by one digit each row. Each row prints consecutive digits from 1 up to i, expanding from top to bottom.

In C you usually solve it with two nested for loops: the outer loop picks the row, the inner loop prints digits 1..i on that row, then printf("\n") moves to the next line.

Why it matters?

It is a natural follow-up after Program 4’s left-aligned descending triangle. Once nested loops and printf/printf("\n") click, pyramids, diamonds, and hollow shapes become much easier.

Key Highlights

Row = Digit Count

On row i, print digits 1 through i.

Two Nested Loops

Outer counts up rows; inner prints digits 1..i.

Print Then Break

printf("%d", j) in the inner loop; printf("\n") after.

Series Foundation

Natural step after Program 4; gateway to pyramid and hollow patterns.

In short: for each row i from 1 up to rows, print digits 1..i with printf("%d", j), then call printf("\n").

Foundation

📝 Problem & Approach

Given a positive integer rows, print an ascending number triangle: each row i shows digits 1 through i, with the outer loop counting from 1 up to rows.

c
// rows = 5
//1
//12
//123
//1234
//12345

Inputs & Outputs

ItemTypeDescription
rowsintNumber of triangle lines to print (typically ≥ 1).
Printed outputtextEach row prints 1..i; the first row has one digit, the last row has rows digits.

Minimal workflow

Pseudocode
for i from 1 to rows:
    for j from 1 to i:
        print j (no newline)
    print newline

Approach comparison

ApproachIdeaBest for
Nested loopsOuter rows + inner digitsLearning and interviews
Spaced outputprintf("%d ", j)Easier reading per row
Cheat Sheet

⚡ Quick Reference

GoalPattern
Walk each rowfor (i = 1; i <= rows; i++)
Print digits 1..ifor (j = 1; j <= i; j++) printf("%d", j);
End the rowprintf("\n");
Spaced digitsprintf("%d ", j);
Program 1 contrastfor (i = rows; i >= 1; i--) (descending outer)
Compare

📋 Fixed Rows vs User Input vs Spaced Output

Same ascending number triangle — different ways to control rows and formatting.

Outer loop
i = 1..rows

Counts up each row — triangle grows

Inner loop
j = 1..i

Prints ascending digits per row

Spaced digits
printf("%d ", j)

Optional space between numbers on each row

Learning tip
scanf

Validate row count when reading scanf input

Context

When This Pattern Shows Up

Reach for this triangle when teaching or testing nested-loop basics.

  1. Post Program 4 exercise

    Natural follow-up after Program 4 — same inner loop but the outer loop counts up instead of shrinking rows.

  2. Nested-loop warm-up

    Outer/inner bound practice with an immediate visual check.

  3. Standard I/O practice

    Combine loops with scanf for a flexible row count.

  4. Gateway to variants

    Compare Program 1 (descending outer) and Program 6 (next in series) next.

  5. Not a UI layout tool

    This is a console teaching pattern — not how you build modern app screens.

Key benefit: one small program that locks in nested loops, output sequencing, and O(n²) thinking.

Interactive

🔮 Live Preview

Choose a row count between 3 and 9 and draw the ascending number triangle in the browser.

Try 4, 5, or 7. Max up to 9 in this preview.

Live result
Press "Draw pattern".
Hands-On

Examples Gallery

Three complete C programs — fixed rows, user input, and a spaced-output variant. Click View Output to reveal sample console results.

📚 Getting Started

Print five rows of the ascending number triangle with nested loops.

Example 1 — Fixed rows = 5

Hard-coded height — ideal for first demos and screenshots.

c
#include <stdio.h>

int main() {
    int rows = 5;
    int i, j;

    for (i = 1; i <= rows; i++) {
        for (j = 1; j <= i; j++)
            printf("%d", j);

        printf("\n");
    }

    return 0;
}

How It Works

When i = 1, the inner loop prints 1. When i = 5, it prints 12345 — each row adds one more digit. printf("\n") after the inner loop starts the next row.

📈 Practical Variant

Let the user choose the height at runtime.

Example 2 — User Input Version

Read rows with scanf and validate the result.

c
#include <stdio.h>

int main() {
    int rows;
    int i, j;

    printf("Enter the number of rows: ");
    if (scanf("%d", &rows) != 1 || rows < 1)
        return 1;

    for (i = 1; i <= rows; i++) {
        for (j = 1; j <= i; j++)
            printf("%d", j);

        printf("\n");
    }

    return 0;
}

How It Works

Same inner-loop core as Example 1; only the source of rows changes from a literal to user input.

⚡ Spaced Output

Add a space between digits for easier reading on each row.

Example 3 — Spaced Digits

Keep rows = 5 but print each digit followed by a space.

c
#include <stdio.h>

int main() {
    int rows = 5;
    int i, j;

    for (i = 1; i <= rows; i++) {
        for (j = 1; j <= i; j++)
            printf("%d ", j);

        printf("\n");
    }

    return 0;
}

How It Works

Only the print statement changes — printf("%d ", j) instead of printf("%d", j). Loop bounds stay the same as Example 1.

🧠 How the Algorithm Prints Rows

1

Set up

#include <stdio.h> brings in printf and scanf. Set rows (fixed or from input).

Setup
2

Outer loop (rows)

for (i = 1; i <= rows; i++) selects the current line, starting at one digit and growing.

Row
3

Inner loop (digits)

for (j = 1; j <= i; j++) prints digits 1..i with printf("%d", j).

Digits
4

New line

printf("\n") ends the row so the next outer iteration starts fresh.

Break
=

Ascending triangle complete

Total digit prints: 1+2+…+n = n(n+1)/2 — O(n²) time, O(1) extra memory.

Trace

🔎 Worked Walkthrough — rows = 5

Trace each outer-loop value of i (counting up) and count how many digits the inner loop prints.

iInner j rangePrinted rowDigits this row
11..111
21..2122
31..31233
41..412344
51..5123455

Total digit prints: 1 + 2 + 3 + 4 + 5 = 15 = 5×6/2.

Use Cases

Where this tiny pattern (and its loop structure) shows up beyond the homework prompt.

1. Teaching Nested Loops

Clearest visual proof that outer and inner bounds interact.

Example: change j <= i and watch the shape change.

2. Pattern Series Base

Foundation for inverted, pyramid, diamond, and hollow variants.

Example: Program 4 shrinks each row from rows down to i.

3. Output Formatting Drills

Practice printf("%d", j) vs printf("\n") without complex math.

Example: put printf("\n") inside the inner loop by mistake.

4. Character Substitution

Swap digits for letters, stars, or spaced output once the loop works.

Example: use printf("%d ", j) for spaced digits on each row.

5. Complexity Intuition

Triangular totals make O(n²) concrete for beginners.

Example: count printed digits for n = 10 → 55.

6. Input Validation Labs

Pair the pattern with scanf and positive-row checks.

Example: reject rows <= 0 and re-prompt.

Pro Tip: when an interviewer asks for patterns, explain the outer/inner roles first — then write the loops. The story matters as much as the code.

Advantages

Why this pattern earns a permanent spot in beginner C courses.

  1. 1. Instant Visual Feedback

    Wrong bounds show up immediately as a broken staircase.

  2. 2. Minimal Concepts

    Only loops and console output — no arrays or math libraries.

  3. 3. Easy to Extend

    Invert, center, hollow, or change the fill character with small edits.

  4. 4. O(1) Extra Memory

    Streaming output needs no storage beyond loop counters.

Pro Tip: trace i and j on paper for rows = 3 before coding — watch how each row grows by one digit.

Usage Tips

Small habits that keep number-pattern code clean.

  1. 1. Name Bounds Clearly

    Use rows (or n) and keep i/j for row/column — or rename to row/col.

  2. 2. Prefer scanf

    Avoid crashes when the user types letters instead of a number.

  3. 3. Keep Newline Outside

    Only call printf("\n") after the inner loop finishes the row.

  4. 4. Count Down on the Outer Loop

    1..rows with j <= i matches “row i prints digits 1..i” naturally.

  5. 5. Dry-Run One Small n

    Trace rows = 3 on paper before coding larger demos.

Pro Tip: if the output is a vertical list of single digits, you almost certainly put printf("\n") inside the inner loop.

Common Pitfalls

Mistakes that commonly break ascending number triangles.

  1. 1. Newline Inside the Inner Loop

    Each digit lands on its own line — you get a column, not a triangle.

    → Use printf("%d", j) for digits; printf("\n") only after the inner loop.

  2. 2. Wrong Inner Bound

    j <= rows prints a rectangle; wrong outer bounds flatten or invert the shape.

    → For this shape, keep j <= i.

  3. 3. Forgetting the Row Break

    Omitting printf("\n") glues every digit onto one endless line.

    → Always end the row after the inner loop.

  4. 4. Blind scanf

    Letters or empty input leave rows unread when scanf is unchecked.

    → Check scanf return value and re-prompt on failure.

  5. 5. Off-by-One on 0-Based Loops

    Switching to i = 0 without adjusting the inner bound prints an empty first row or wrong counts.

    → If 0-based, print digits 1..i+1 (e.g. j <= i + 1).

Edge Cases

Check these inputs before calling the solution done.

rows = 1

Single digit row

Output is just 1 on one line.

rows = 0

Empty pattern

Outer loop never runs — print nothing or show a message.

Negative

rows < 0

Treat as invalid; re-prompt instead of silent empty output.

Large n

Many rows

Output grows as n²/2 characters — fine for labs, noisy for huge n.

Bad input

Non-numeric scanf

Unchecked scanf leaves rows uninitialized — check the return value.

Fill char

Spaced digits

Try printf("%d ", j) for spaces between numbers.

Drill

🎯 Practice Problems

Try these variations to lock in the pattern.

1. Classic descending triangle

  • Outer loop counts down; inner prints 1..i
  • Compare with Program 1

2. Left-aligned descending

  • Review Program 4
  • Same outer loop, different inner bounds

3. Next in series

  • Continue with Program 6
  • Build on the same nested-loop skills

4. Spaced output

  • Use printf("%d ", j) between digits
  • Same loops, wider visual spacing
Important

Notes

  • Triangular count. Total digit prints for n rows is n(n+1)/2 — hence O(n²) time.
  • printf stays on the line; printf("\n") advances — mix them carefully.
  • Validate rows > 0 for interactive programs; rows = 1 should print a single 1.
  • This page is left-aligned. Centered pyramids need leading spaces — covered later in the series.

Quick Takeaway: outer loop picks the row, inner loop prints digits 1..i, then break the line — that is the whole pattern.

Analysis

⏱️ Time and Space Complexity

ProgramTimeExtra space
Nested loops (Examples 1–2)O(rows²)O(1)
Spaced output (Example 3)O(rows²)O(1)
Wrap Up

🎉 Conclusion

The ascending number triangle pattern is a small nested-loop exercise with lasting payoff: row/column thinking, printf vs printf("\n"), and O(n²) intuition. Master the fixed-rows version, then try user input and spaced output.

Practice the three examples above, then continue to Program 6 for the next pattern in the series.

Row i prints 1..i — keep printf("%d", j) for digits and printf("\n") for the break, and validate row counts when reading input.

View Examples Gallery Continue to Program 6
Pro Tips

💡 Best Practices

✅ Do

  • Explain outer counts up, inner prints 1..i before coding
  • Use for (i = 1; i <= rows; i++) in the outer loop
  • Use printf("%d", j) for digits and printf("\n") after each row
  • Validate rows ≥ 1 for interactive programs
  • Prefer scanf with return-value checks over unchecked reads
  • State O(n²) time when asked about complexity

❌ Don’t

  • Call printf("\n") inside the inner digit loop
  • Use descending outer loop when you meant this ascending triangle
  • Skip the newline after each row
  • Ignore bad input in user-facing demos
  • Skip the rows = 1 edge case
Summary

Key Takeaways

Knowledge Unlocked

Five things to remember about this number pattern

Print the triangle the beginner-friendly way.

5
Core concepts
△ 01

Rule

Row i prints 1..i

Definition
↻ 02

Outer loop

Controls each row

Code
1 03

Inner loop

Prints digits with printf("%d", j)

Code
↵ 04

Newline

printf("\n") ends each row

I/O
O 05

Complexity

O(n²) time

Analysis
🎯 You’re ready to print an ascending number triangle in C
Review Quick Reference →

❓ Frequently Asked Questions

The outer loop runs i from 1 to rows. For each row i, the inner loop runs j from 1 to i and prints j with printf("%d", j). Row 1 prints 1, row 2 prints 12, and so on until row rows prints 1..rows.
Because the outer loop counts up and the inner bound equals i. When i increases (1, 2, 3, ...), each row prints one more digit than the previous row.
When i = 1, the inner loop runs j from 1 to 1 — exactly one digit. Each next row adds one more value to the inner bound.
printf("%d", j) stays on the same line. printf("\n") ends the current row. Digits use printf without newline; the row break uses printf("\n") after the inner loop.
Program 1 counts the outer loop down and prints 12345, 1234, ... Program 5 counts up and prints 1, 12, 123, ... — same inner loop, opposite outer direction.
Program 4 prints rows..i in descending order (54321, 5432, ...). Program 5 prints 1..i in ascending order — a growing triangle instead of a shrinking one.
Replace 5 with rows in the outer loop bound — see Example 2.
Count the outer loop down: for (i = rows; i >= 1; i--). Keep the inner loop as for (j = 1; j <= i; j++) — that is Program 1.
O(n²) for n rows because total prints are 1 + 2 + ... + n = n(n+1)/2.
Check scanf return value: if (scanf("%d", &rows) != 1) handle bad input. Unchecked scanf leaves rows uninitialized on failure.
Only one row prints — a single digit 1 on one line.

Did you Know? 🔊

Row i prints digits 1 through i. The outer loop counts up from 1 to rows, so each row grows by one digit — still O(n²) total prints.

Continue to Program 6

Move on to the next pattern in the C number-pattern series.

Program 6 tutorial →

About the author

Mari Selvan M P
Mari Selvan M P 🔗

Developer, cloud engineer, and technical writer

  • Experience 12 years building web and cloud systems
  • Focus Full Stack Development, AWS, and Developer Education

I write practical tutorials so students and working developers can learn by doing—from databases and APIs to deployment on AWS.

AWS Certified Developer – Associate (Credly)

11 people found this page helpful

C Number Pattern 4 C Number Pattern 6