Demonstrates visually how Bubble Sort algorithm works. This algorithm is the most basic and the most inefficient at O(n^2) runtime complexity. The algorithm should be used when number of elements to be sorted is less than 50. Click on shuffle to randomize ordering. Slowly click on step button to see how coins are sorted.
Books: - Algorithms by Robert Sedgewick, Kevin Wayne - The Bible of Algorithms and Data Structure by Florian Dedov - and other books on data structure and algorithms
