Visualizer
Linear Search Visualizer
Scan a list left to right, one element at a time, until the target turns up or the list runs out — no sorted-input requirement, unlike Binary Search.
Visualizer
Quick Sort Visualizer
Partition around a pivot so smaller elements land left and larger land right, then recurse — fast in practice, O(n²) on an unlucky pivot.
Visualizer
Merge Sort Visualizer
Recursively split the array in half, then merge the sorted halves back together — guaranteed O(n log n), at the cost of O(n) auxiliary space.
Visualizer
Counting Sort Visualizer
Count occurrences of each value directly instead of comparing elements — O(n + k) time when the value range k is small and known.
Visualizer
Radix Sort Visualizer
Repeated Counting Sort passes, one per digit, least significant first — builds on Counting Sort's bucket pattern.
Visualizer
Heap Sort Visualizer
Build a max-heap, then repeatedly extract the maximum into a shrinking sorted tail — O(n log n) with O(1) auxiliary space.