C Academy · Lesson

Recursion vs Iteration

When to choose each.

Recursion vs Iteration is a free C Academy lesson on CoddyKit — lesson 3 of 4. You can read the complete lesson below for free — then practise it hands-on in the browser with a built-in code editor and a 24/7 AI tutor. It is part of the C Academy learning path, one of 4 lessons in the course, and your progress syncs across the web and the CoddyKit app.

Two Ways To Repeat

Many problems can be solved with either recursion or iteration. Iteration uses loops; recursion uses function calls.

Both can produce the same result, but they differ in style, memory use, and speed.

Factorial With A Loop

Here is factorial written iteratively with a for loop. No function calls itself; a single variable accumulates the product.

#include <stdio.h>

long factorial(int n) {
    long result = 1;
    for (int i = 2; i <= n; i++)
        result *= i;
    return result;
}

int main(void) {
    printf("%ld\n", factorial(6));
    return 0;
}

Factorial With Recursion

The recursive version is shorter and mirrors the math definition directly.

Both print 720 for factorial(6), but they use different machinery.

long factorial(int n) {
    if (n <= 1) return 1;
    return n * factorial(n - 1);
}

Memory Differences

Iteration usually uses a fixed, small amount of memory: just a few local variables.

Recursion adds a stack frame for every call, so deep recursion uses more memory and can run out of stack space.

Speed Differences

Each recursive call has a small cost: setting up a frame and returning from it.

For simple counting tasks, loops are often a bit faster because they avoid that call overhead.

When Recursion Wins

Recursion shines when the problem is naturally recursive, like trees, nested structures, or divide-and-conquer algorithms.

There, recursive code is shorter and clearer than the equivalent loop with a manual stack.

When Iteration Wins

For straightforward linear repetition like summing an array or counting, a loop is simpler and uses constant memory.

It also avoids any risk of stack overflow on large inputs.

int sum_array(int a[], int n) {
    int total = 0;
    for (int i = 0; i < n; i++)
        total += a[i];
    return total;
}

Same Task, Both Styles

Summing 1 to n can be done either way. Here is the iterative version returning the same answer as recursion.

#include <stdio.h>

int sum_to(int n) {
    int total = 0;
    for (int i = 1; i <= n; i++)
        total += i;
    return total;
}

int main(void) {
    printf("%d\n", sum_to(100));
    return 0;
}

Converting Recursion To A Loop

Any recursion can be rewritten as iteration, sometimes using your own explicit stack.

Simple linear recursion, like factorial or sum, converts to a plain loop with an accumulator variable.

#include <stdio.h>

int main(void) {
    int n = 5, result = 1;
    while (n > 1) { result *= n; n--; }
    printf("%d\n", result);
    return 0;
}

Tail Recursion Note

A tail-recursive call is the last action in a function. Some compilers optimize it into a loop, reusing one frame.

C does not guarantee this, so do not rely on it for deep recursion.

int sum_tail(int n, int acc) {
    if (n == 0) return acc;
    return sum_tail(n - 1, acc + n);
}

Choosing An Approach

Ask: is the problem naturally nested or divide-and-conquer? Then recursion fits.

Is it simple linear repetition with possibly huge input? Then iteration is safer and often faster.

Quick Check

Compare the two approaches.

Recap

Recursion and iteration can solve the same problems. Loops use constant memory and are great for linear tasks; recursion is clearer for nested and divide-and-conquer problems but costs a stack frame per call.

Frequently asked questions

Is the “Recursion vs Iteration” lesson free?

Yes — the full text of “Recursion vs Iteration” is free to read here on the web, and the C Academy course includes 4 lessons in total. To practise it interactively (a built-in code editor and a 24/7 AI tutor) and unlock the rest of the C Academy course, upgrade to CoddyKit PRO.

What will I learn in “Recursion vs Iteration”?

When to choose each. You practise C Academy with hands-on code you run directly in the browser, and a 24/7 AI tutor answers your questions as you work through the lesson.

Do I need any experience to start C Academy?

No prior experience is required. C Academy on CoddyKit is structured for beginners through advanced learners; this is — lesson 3 of 4, so you can start here or from the beginning and move at your own pace.

How long does the “Recursion vs Iteration” lesson take?

Most CoddyKit lessons take about 5–10 minutes. Each one is bite-sized and interactive, so you make steady progress and pick up exactly where you left off across the web and the app.

Can I write and run code in this C Academy lesson?

Yes. Every C Academy lesson includes a built-in code editor, so you write and run real code right in your browser and get instant AI feedback — no local setup required.

All lessons in this course

← Back to C Academy