Sequential Search
Definition
Sequential search, also known as linear search, is a simple searching algorithm that checks each element in a list one by one until the desired element is found or the end of the list is reached.
Analogy
Imagine you are looking for your favorite book in a library. You start from the first shelf and check each bookshelf one by one until you find it or reach the last shelf.
Related terms
Traversing a List: It refers to moving through each element of a list, either to perform an operation on each element or to search for a specific element.
Binary Search: A more efficient searching algorithm that divides the sorted list into halves and eliminates half of the remaining elements at each step.
Linear Data Structure: A data structure where elements are arranged sequentially, such as arrays and linked lists.
"Sequential Search" appears in:
Subjects (1)
Study guides (1)
Are you a college student?
Study guides for the entire semester
200k practice questions
Glossary of 50k key terms - memorize important vocab
Resources
© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.