Loading…
Watch sorting algorithms in action! Compare Bubble Sort, Quick Sort, Merge Sort, and more with step-by-step visualization. Review the result before reusing it in another workflow.
Repeatedly swaps adjacent elements if they are in wrong order. Simple but inefficient.
Finds the minimum element and places it at the beginning. Performs well on small lists.
Builds the sorted array one item at a time. Efficient for small or nearly sorted data.
Divide and conquer algorithm. Consistent O(n log n) performance but uses extra space.
Divide and conquer using a pivot. Very fast in practice despite O(n²) worst case.
Uses a binary heap data structure. Guaranteed O(n log n) with constant space.