Linear Search Visualizer - Sequential Search Logic

Linear Search: how it works

Linear search is the simplest search algorithm. It sequentially checks each element of the list until a match is found or the whole list has been searched.

1. Start at the Beginning

   Begin with the very first element in the array (index [0]).

2. Compare

   Compare the element at the current index with the target value. If they match, search succeeds.

3. Move Forward

   If no match, increment index and check the next element. Repeat until target is found or end is reached.

Complexity

Best-case time

O(1)

Average time

O(N)

Worst-case time

O(N)

Space

O(1)

Linear search rarely used in practice for large arrays because other search algorithms like binary search are much faster. However, it is the only viable option if the list is unsorted.