Explore, visualize, and understand the inner workings of various sorting algorithms through interactive demonstrations
Simple comparison-based algorithm that repeatedly steps through the list.
Divides input into sorted and unsorted regions, repeatedly selects smallest element.
Builds sorted array one item at a time, efficient for small datasets.
Divide and conquer algorithm that splits, sorts, and merges sublists.
Fast divide and conquer algorithm using pivots to partition elements.
Non-comparative integer sorting algorithm that counts occurrences.
Non-comparative sorting that processes individual digits or characters.
Distributes elements into buckets, then sorts each bucket individually.
Comparison-based sort using a binary heap data structure.