Algorithm
Sequence of steps that solves a problem by generating correct output for any valid input values
Algorithm Time Efficiency
The number of calculations required to solve a problem
Linear Search
Starts with first items and checks each item until found or reaching the list’s end
Linear search may be slow
Binary Search
Check’s the range’s middle. If the value is greater, the search is made on the upper half. If less, on lower half. Search continues until found or no range remains.