Lecture
This lecture covers the linear search algorithm, which examines elements in a list one at a time to locate an item, and the binary search algorithm, which efficiently finds an item in a sorted list by repeatedly dividing the search interval in half.