DATA STRUCTURES • ALGORITHMS

Linear Search

A search algorithm that checks every element in a list sequentially until a match is found or the whole list has been searched.

Time

O(N)

Space

O(1)

Key Principle 1

Works on unsorted data

Key Principle 2

Simplest search algorithm

Key Principle 3

Inefficient for large datasets

Key Principle 4

Used in small arrays

LINEAR_SEARCH_LAB
ARRAY:
TARGET:
Current Step
Searching for target: 70. Starting from index 0.
Playback
Speed
Search Stats ⠿
TARGET70
Iundefined
STATUSStarting
Search Logic ⠿
1for (int i = 0; i < size; i++) {
2    if (arr[i] == target) {
3        return i; // Found
4    }
5}
6return -1; // Not found
10
[0]
50
[1]
30
[2]
70
[3]
80
[4]
60
[5]

Loading Lab...