DATA STRUCTURES • ALGORITHMS

Array Traversal

The process of visiting each element in an array exactly once to perform some operation like printing, searching, or modifying data.

Time

O(N)

Space

O(1)

Key Principle 1

Linear time complexity

Key Principle 2

Foundation for searching & sorting

Key Principle 3

Iterates through indices 0 to N-1

Key Principle 4

Non-destructive operation

TRAVERSAL_LAB
ARRAY:
Current Step
Array traversal visiting each element exactly once.
Playback
Speed
Iteration Stats ⠿
Iundefined
ELEMENTN/A
Code Execution ⠿
1for (int i = 0; i < size; i++) {
2    // Accessing element at i
3    cout << arr[i] << " ";
4}
5// Traversal complete
10
[0]
20
[1]
30
[2]
40
[3]
50
[4]

Loading Lab...