Linear Search Visualizer
Visualize linear search algorithm on an unsorted array
Array Size
Search Target
Actions
Step Through
Step: 1/0 | Found: ?Linear Search Algorithm
Array Visualization
Not Checked
Checked
Current
Found
Algorithm Properties
Time Complexity:O(n)
Space Complexity:O(1)
Requirement:Any Array
Best Case:O(1)
Worst Case:O(n)
How It Works
1. Start from the first element
2. Compare current element with target
3. If match found, return index
4. If no match, move to next element
5. Repeat until end of array
6. If not found, return -1