Linear Search

Definition

A linear search is a simple searching algorithm that checks each element in a list or array one by one until the target value is found or the end of the list is reached.

Related terms

Sequential Search: Another term for linear search. It refers to searching through elements in a sequential order until finding the desired value.

Complete Traversal: The process of examining every element in a data structure, such as an array or list, without stopping early even if the target value is found.

Binary Search: A more efficient search algorithm that divides a sorted list into halves and compares the middle element with the target value to determine which half to continue searching.