Linear Search

Check every element one by one until the target is found — or the array ends. Simple, universal, finds all occurrences in a single pass.

Visualization

Target:

Speed

Currently checkingFoundAlready checkedUnchecked

Target

Comparisons

1/0

Step

Ready — click Play or step through manually.

O(1)

Best Case

O(n)

Worst Case

O(n)

Average

O(1)

Space

Question 1 of 3

What is the time complexity of linear search in the worst case (target not present)?

Searching Algorithms

Loading Searching Algorithms...

Search Visualization

sorted arrayindex 0