Searching & Sorting

Practice Patterns Sorting

Sorting transforms an unordered array into a predictable order while exposing comparisons, swaps, and locked regions.

Time

O(N log N) / O(N^2)

Space

O(1) to O(N)

Trace Steps

Interactive Array

[0]

[1]

[2]

[3]

[4]

[5]

[6]

[7]

Step Timeline

Code + State

1for each pass

2    compare neighboring values

3    swap if out of order

4    lock the largest suffix

What To Watch

Edit the array, then replay the trace from the beginning.

Drag numbers to create your own input order.

Each step shows active indices, ranges, variables, and the matching code line.

Use next or autoplay to watch the algorithm state evolve one decision at a time.

Loading Lab...