🔵 BeadSort in the web!
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
css
js
README.md
index.html

README.md

BeadSort

Check out the demo here

What Is It?

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