Visualize how different algorithms sort data in real-time.
The Sorting Algorithm Visualizer is an interactive educational tool designed to help students and developers understand how computer science algorithms work. By watching the step-by-step sorting process, you can visualize the efficiency and behavior of Bubble Sort, Quick Sort, Merge Sort, and more.
A simple comparison-based algorithm that swaps adjacent elements if they are in the wrong order. It is easy to understand but inefficient for large datasets.
Repeatedly finds the minimum element and places it at the beginning. It performs fewer swaps than Bubble Sort.
Builds the sorted array one item at a time. It is efficient for small data sets or nearly sorted arrays.
A highly efficient algorithm that divides the array into halves, sorts them, and then merges them back together.
An efficient algorithm that picks a 'pivot' element and partitions the array around it. It is one of the fastest sorting algorithms in practice.