Linear Search
SearchingEasyScan array elements sequentially to locate match values.
Alt+Shift+L
Configuration Panel
Sequential Sweep Pointer Index Highlight
50
81
122
163
234
385
566
727
Time Complexity
O(N) linear sweep
Space Complexity
O(1) auxiliary variables
Conceptual Overview
Linear Search checks each element of the array sequentially from start to end until a match is found or the array is exhausted.
Algorithm Idea
Initialize index pointer at 0. Increment pointer and compare each cell value to the target. Returns index if found, else -1.
Stable Sorting
N/A
In-place Memory
N/A
Source: CP-Algorithms search & sorting reference