Skip to content

mjkaufer/BeadSort

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 

Repository files navigation

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

About

🔵 BeadSort in the web!

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published