Sequential/linear search

Definition

Sequential or linear search is a simple searching algorithm that checks each element in a list or array one by one until the desired element is found or the end of the list is reached. It is commonly used for small lists or unsorted data.

Related terms

binary search: Binary search is an efficient searching algorithm that divides a sorted list into two halves and repeatedly narrows down the search range by comparing the target value with the middle element.

sorting algorithms: Sorting algorithms are methods used to arrange elements in a specific order, such as ascending or descending. They can be applied before performing searches to optimize efficiency.

time complexity: Time complexity refers to how long an algorithm takes to run based on its input size. It helps analyze and compare different algorithms' efficiency in terms of execution time.