Sort Visualizer

Simple implementation of sort algorithms visualisation in Java

• Merge Sort O(nlog(n))

• Quick Sort O(nlog(n)) (O(n²) for the worst case if you choose the bad pivot)

• Bubble Sort (O(n²))

• Selection Sort (O(n²))

• Radix Sort LSD (O(nw) where w is the average key length measured in number of digits)

• Insertion Sort (O(n²))