Sorting Visualizer

Bubble sort is a simple, effective, and easy to understand sorting algoritm. Although it is not suitable for large data sets, it is a great place to start learning about sorting algorithms.

Insertion Sort is arguably the most intuitive sorting algorithm. While it does have a high time complexity, it is still considered a useful algorithm because it is very efficient with smaller lists.

Despite selection sort's inefficiency with large data sets, it works well in situations with small lists and limited memory. It sorts in-place, using no storage beyond what is needed for the original list.

Quick sort is a recursive algorithm noted for its speed and efficiency. It divides the array into subarrays and then recursively sorts the subarrays of these subarrays until the array is sorted.