Linear search, also known as sequential search, is an algorithm used to find the position/index of an element within an unordered list by checking each element one by one until the desired element is found or all elements have been checked.
Related terms
Binary Search: An efficient search algorithm that divides a sorted list into two halves and repeatedly narrows down the search range by comparing the target element with the middle element.
Hashing: A technique that maps data to a fixed-size array, allowing for quick retrieval of information based on its key.
Sorting Algorithms: Algorithms used to arrange elements in a specific order, such as ascending or descending, making it easier to search for specific elements.