This is the most simplistic sorting algorithm; it has computational complexity O[n*n], but for short lists it can actually be quite competitive. Try the program by clicking on "Run Program". Want to learn more? Wikipedia has a good article. You can experiment with the variable N to see how the algorithm get much slower for longer lists. Compare also with the Merge Sort algorithm.
Quite BASIC is a BASIC interpreter written in Javascript and it looks like either your browser doesn't support Javascript or Javascript is disabled. This means that the site will not function properly. We recommend newer versions of IE or Firefox. On Macs, use Safari or Firefox, and on Linux systems we recommend Firefox. Opera should work too.
Sample programs to try and to mash up!
Take Quite BASIC to your Google home page!
Create and manage your projects!
Change the canvas, clear the output etc.
Documentation
Credits, copyrights, and information