Searching
Binary Search
Cut a sorted range in half on every step to find a value or boundary in O(log n) instead of checking one by one.
Read →
Searching
Find a value or boundary inside a collection without checking every element one by one.
Find a value or boundary inside a collection without checking every element one by one.