Searching & Sorting

Introduction To Searching

Searching narrows a candidate space until the target position, boundary, or proof of absence is known.

Time

O(log N) or O(N)

Space

O(1) to O(N)

Trace Steps

Interactive Array

[0]

[1]

[2]

[3]

[4]

[5]

[6]

[7]

Step Timeline

Code + State

1prepare the search space

2inspect the current candidate

3discard impossible positions

4continue until answer is found

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...