Display Multiplication Table in C

What You’ll Learn

A multiplication table (times table) for a base n is the list of products n×1, n×2, … — usually through 10. This tutorial covers a clear for loop with printf, a live preview you can retarget, worked C examples (fixed base 5 and scanf input), edge cases, and O(k) complexity for k rows.

📝 Problem & Approach

Given a base and a last multiplier, print each product on its own line with a clear header.

/* base = 5, last = 10
 * 5 x 1 = 5
 * 5 x 2 = 10
 * …
 * 5 x 10 = 50
 */

Inputs & Outputs

Minimal workflow

procedure print_table(base, last):
    print header with base
    for i from 1 to last:
        print base, i, and base * i

Method comparison

🔮 Live Preview

Default base 5 matches Example 1. Change it to any reasonable integer; rows run from 1 to 10.

Press “Print table”.

Examples Gallery

Two complete C programs — a fixed table for 5, then the same helper with scanf and validation. Click View Output to reveal sample console results.

#include <stdio.h>

void print_multiplication_table(int base, int last) {
    printf("Multiplication table for %d:\n", base);

    for (int i = 1; i <= last; ++i) {
        printf("%d x %d = %d\n", base, i, base * i);
    }
}

int main(void) {
    const int base = 5;
    const int last = 10;

    print_multiplication_table(base, last);
    return 0;
}

Multiplication table for 5:
5 x 1 = 5
5 x 2 = 10
5 x 3 = 15
5 x 4 = 20
5 x 5 = 25
5 x 6 = 30
5 x 7 = 35
5 x 8 = 40
5 x 9 = 45
5 x 10 = 50

#include <stdio.h>

void print_multiplication_table(int base, int last) {
    printf("Multiplication table for %d:\n", base);
    for (int i = 1; i <= last; ++i) {
        printf("%d x %d = %d\n", base, i, base * i);
    }
}

int main(void) {
    int n;

    printf("Enter a positive integer: ");
    if (scanf("%d", &n) != 1) {
        printf("Could not read an integer.\n");
        return 1;
    }
    if (n <= 0) {
        printf("Please enter a positive integer.\n");
        return 1;
    }

    print_multiplication_table(n, 10);
    return 0;
}

Enter a positive integer: 4
Multiplication table for 4:
4 x 1 = 4
4 x 2 = 8
4 x 3 = 12
4 x 4 = 16
4 x 5 = 20
4 x 6 = 24
4 x 7 = 28
4 x 8 = 32
4 x 9 = 36
4 x 10 = 40

🔎 Worked Walkthrough — First Rows for Base 5

Trace how i produces each product when base = 5.

Every other row follows the same pattern until i reaches last.

🔄 Input / Output

Example 1 needs no input. Example 2 reads one integer from standard input; you can switch to a fixed value while learning, then add scanf when you are ready.

🎯 Practice Problems

Try these variations to lock in the pattern.

Notes

⏱️ Time and Space Complexity

💡 Best Practices