SearchingSearching

Linear Search

Scan elements one by one until the target is found or the input is exhausted.

Learn Linear Search →
2
0
5
1
8
2
12
3
16
4
23
5
38
6
56
7
72
8
91
9
1/7Search for 23 by checking every element from left to right. No ordering is assumed, so nothing can be skipped.
Being compared with targetTarget foundEliminated
PseudocodeLearn Linear Search →
1for i in 0 .. n-1:
2  if a[i] == target: return i
3return -1
Variables
target23
Complexity
best O(1)
avg O(n)
worst O(n)
space O(1)
Speed