Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more about the CLI.
Please sign in to use Codespaces.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download Xcode and try again.
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
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