CAMBRIDGE IGCSE 0478

Nested Loops & Multidimensional Iteration

Instructional Theory

A Nested Loop is a control structure where one loop resides completely inside the body of another loop.

1. Mechanics of Nested Loops

In a nested loop:

The outer loop begins its first iteration.
The inner loop executes and completes all of its iterations.
Only after the inner loop finishes completely does the outer loop advance to its second iteration.
This cycle repeats until the outer loop reaches its termination bound.

[Outer Iteration 1]
    ├── [Inner 1]
    ├── [Inner 2]
    └── [Inner 3]
[Outer Iteration 2]
    ├── [Inner 1]
    ├── [Inner 2]
    └── [Inner 3]

\text{Total Cycles} = (\text{Outer Iterations}) \times (\text{Inner Iterations})

Independent Identifiers: The outer loop and inner loop must use different counter variables (e.g. Row and Col, or i and j). Re-using the same counter corrupts loop progression.
Proper Nesting Order: The inner loop must be completely closed (NEXT Inner) before the outer loop closes (NEXT Outer). Crossing loop boundaries is a syntax violation.

All-Access

Need guidance? Ask a question or use the hint below.

Unlock step-by-step Socratic hints, algorithm trace table walkthroughs, and error diagnostics for every Cambridge exercise.

You're chatting with an AI tutor, not a person. AI can make mistakes, so double-check its answers.

Exercise:

• Drag & Drop

+35 XP

Complete the closing NEXT statements for this nested grid traversal:

PSEUDOCODE

FOR Row <- 1 TO 3
    FOR Col <- 1 TO 4
        OUTPUT Grid[Row, Col]
    NEXT [Space 1]
NEXT [Space 2]

Word Bank / Available Cards (Drag into spaces or tap to place) Tap card to auto-place • Tap placed card to return

All-Access Required

Interactive exercises for Module 2 and beyond require an active plan.