Searching

Binary search finds a target value in a sorted list by repeatedly halving the search space. It is dramatically faster than linear search for large datasets.

Linear search checks each item in a list one by one until it finds the target or reaches the end. It is the simplest search algorithm and works on any list, sorted or unsorted.

Searching algorithms find a specific item within a collection of data. The two most fundamental approaches are linear search and binary search.