A linear search algorithm is a simple searching algorithm that sequentially checks each element in a list until it finds the target value or reaches the end of the list.
Imagine you are looking for your favorite book in a bookshelf. You start from the first book and check each one until you find it or reach the end of the shelf.
Binary Search Algorithm: A more efficient searching algorithm that divides a sorted list into halves, eliminating half of the remaining elements at each step.
Array: A data structure that stores a fixed-size sequence of elements of the same type.
Indexing: The process of assigning an index (position) to each element in a data structure for easy access.
Study guides for the entire semester
200k practice questions
Glossary of 50k key terms - memorize important vocab
© 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.