Check out the demo here
BeadSort is a sorting algorithm that, theoretically, would sort integers in O(√n) time (but really big space). However, one cannot capture this efficiency in computer simulations because there's no gravity :(
This project was made to visualize the BeadSort process