DATA STRUCTURES • ALGORITHMS

Reverse Array

Inverting the sequence of elements in an array such that the first element becomes the last, the second becomes the second-to-last, and so on.

Time

O(N)

Space

O(1) (In-place)

Key Principle 1

Two-pointer swap technique

Key Principle 2

Iterates only N/2 times

Key Principle 3

Optimal space efficiency

Key Principle 4

Preserves original data type

REVERSE_LAB
ARRAY:
Current Step
Initialize pointers at the boundaries.
Playback
Speed
Pointer States ⠿
LEFT0
RIGHT5
STATUSReady
Reversal Logic ⠿
1int left = 0, right = n - 1;
2while (left < right) {
3    swap(arr[left], arr[right]);
4    left++;
5    right--;
6}
10
[0]
20
[1]
30
[2]
40
[3]
50
[4]
60
[5]

Loading Lab...