Linear search is a simple searching algorithm that checks each element in a list one by one until it finds a match or reaches the end of the list. It is commonly used when there is no specific order or structure to the data.
Imagine you are looking for your favorite book on a shelf filled with books arranged randomly. You start from one end and check each book until you find what you're looking for or reach the end of the shelf.
Target Value: The value being searched for in a linear search.
Indexing: The process of assigning an index (position) to each element in a data structure.
Sequential Structure: A type of program flow where instructions are executed one after another in order.
© 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.