Sorting algorithms can be broadly classified into three main categories:

• Comparison Sorts: These algorithms work by repeatedly comparing elements to determine their order. They are versatile and can handle various data types.
• Non-Comparison Sorts: These algorithms sort elements without directly comparing them. They often excel with specific data types or situations where certain assumptions can be made about the data.
• Other: These algorithms are not based on comparison or non-comparison sorts. They are not often used in practice, but they can be useful in certain situations.

The choice of sorting algorithm depends on several factors:

• Speed: Some algorithms are generally faster than others, this can be calculated using the time complexity of the algorithm (Big O notation).
• Performance: Some algorithms might require more memory usage than others, or additional data structures, such as heaps or trees.
• Data Type: Some algorithms are optimized for specific data types. Very common data types include integers, floating point numbers, strings...
• Stability: Some Stable sorting algorithms preserve the original order of equal elements. This can be useful in certain situations.

We are free, as in freedom (and free beer too!). You can view our code on GitHub. Feel free to contribute to it as well if you have the capabilities to. For the Reference, we used Wikipedia throughout this whole project.

• Source Code: https://github.com/redeemedspoon/sort-visualizer
• Reference: https://en.wikipedia.org/wiki/Sorting_algorithm