Efficient techniques for finding elements in data structures.
Scans through every element one by one until the target is found (O(n)). Works on unsorted arrays.
Loading...
Finds an element in a sorted array by repeatedly halving the search space (O(log n)). Far faster than linear search for large datasets.
Loading...