Searching Algorithms Flashcards

A searching algorithm that checks each element in a list one by one until the target value is found or the end of the list is reached.

A searching algorithm that repeatedly divides a sorted list in half to locate a target value.

The list must be sorted before performing a binary search.

Linear search is less efficient for large datasets as it checks each element one by one.

Binary search is more efficient than linear search for large datasets as it reduces the search space by half with each step.

Start at the first element of the list.

Compare the current element to the target value. If they match, the search is complete.

If the current element does not match the target, move to the next element and repeat until the target is found or the end of the list is reached.

Identify the middle element of the sorted list.

Compare the middle element to the target value. If they match, the search is complete. If the target is smaller, repeat the search on the left half. If larger, repeat on the right half.