For loop (programming construct)

Typical structure and parts

Although syntax varies by language, most for loops share three conceptual parts: initialization, condition, and update. The initialization prepares any loop counters or iterators. The condition is evaluated before each iteration and determines whether the loop continues. The update changes the counter or advances the iterator so the loop can eventually terminate.

• Initialization: set a counter or obtain an iterator.
• Condition: a boolean expression checked before each iteration.
• Update: modify the counter or move the iterator forward.

Common variants and examples

Syntactic forms differ across languages and paradigms.

• Index-based loop (C-style): for (int i = 0; i < 10; i++) { /* body */ } — common for numeric ranges and arrays.
• Range-based or Python-style: for i in range(10): print(i) — iterates over an explicit sequence or generator.
• For-each over collections: for (element : collection) { ... } or for item in collection — used to traverse arrays, lists, or other containers without manual index handling.
• Infinite for loop: for (;;) { /* body */ } in C-like languages or while (true) — used when termination is managed internally (e.g., event loops).

Some languages use iterators and protocols rather than numeric counters, letting the language handle termination and advancement. Functional languages and modern libraries may provide higher-order iteration constructs (map, filter, for-comprehensions) that abstract common looping patterns.

History and origin

The English keyword "for" in many programming languages is derived from earlier work where a German word "für" was used. Computer scientists who helped design early languages such as ALGOL contributed to the notation and semantics that influenced later languages. The for loop concept evolved as languages standardized ways to express initialization, checking, and advancement compactly in one header.

Uses, examples, and practical notes

For loops are widely used for tasks like processing arrays, generating sequences, numerical computations with known bounds, and implementing algorithms that require nested iteration. Common idioms include nested loops for two-dimensional data, early exit with break to stop iteration when a condition is met, and continue to skip the remainder of a single iteration.

Programmers should be mindful of off-by-one errors when indexing, the cost of repeated work inside loop bodies, and how loop bounds affect algorithmic complexity. When iterating collections, prefer language-native iteration constructs (for-each, iterators) to reduce errors and improve readability.

Distinctions and notable facts

For loops are closely related to while loops; a for loop can often be expressed as an equivalent while loop by moving initialization before the loop and update to the end of the loop body. The for-each variant differs by hiding index management and often preventing modification of the underlying collection during iteration. Compiler optimizations, such as loop unrolling or vectorization, may transform simple for loops for performance, but such optimizations depend on predictable control flow and side-effect-free operations.

For more background or technical references, see Further reading.