Learn
Algorithms
Interactive explanations of core algorithms, with complexity notes and related practice problems.
Algorithms·2·A→Z
Binary Search
Binary Search is a searching algorithm that finds a target in a sorted, randomly-accessible sequence by repeatedly halving the candidate range.
EasyO(log n)261 problemsMerge Sort
Efficient, general-purpose, comparison-based, canonical divide-and-conquer sorting algorithm: split the array in half, recursively sort each half, then merge the two sorted halves into one.
MediumO(n log n)9 problems
Showing all 2