GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.
Sign up
Fetching latest commit…
| Type | Name | Latest commit message | Commit time |
|---|---|---|---|
| Failed to load latest commit information. | |||
|
css | ||
|
|
js | ||
|
|
README.md | ||
|
|
index.html | ||
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