Linear Search Algorithm

Linear Search Algorithm Visually

A simple searching algorithm that checks every element in the list sequentially until the target is found or the list ends.

Searching Algorithm Unsorted Arrays Time Complexity O(n) Space Complexity O(1) Beginner Friendly
Linear Search Controls
comparisons: 0
Steps: 0
Time: 0ms
Simulation Modes
Array Presets
Performance Analysis

Algorithm Status

Ready
Progress 0%

Array Visualization

About Linear Search

Linear search is a simple searching algorithm that sequentially checks each element of the list until a match is found or the whole list has been searched. It works on both sorted and unsorted arrays, making it very versatile reportWindow less efficient than binary search for sorted data.

Time Complexity
O(n)
Worst Case
Space Complexity
O(1)
Auxiliary

Search Target

Current Target: 22

Algorithm Comparison

Linear Search
O(n)
Unsorted Arrays
Binary Search
O(log n)
Sorted Arrays
Jump Search
O(√n)
Sorted Arrays

Execution Log

Operation Log
Linear search visualization initialized
Enter array values and click Initialize to begin