A Simple Bubble Sort Function, glass houses

[Dave Sherman]

[what is this discussion doing in net.sources?]

If you really want to understand n*log(n) sorting techniques,
get hold of the computer-generated film "Sorting Out Sorting"
(Univ. of Toronto, 1981). It's available from the U of Toronto
Media Centre, and many university CS departments have purchased
copies. It uses animation to make quicksort, heapsort and others
easy to understand, and demonstrates (via "races" on many items)
how much better n*log(n) is than n-squared.

Dave Sherman
-- 
 {allegra,cornell,decvax,ihnp4,linus,utzoo}!utcsrgv!dave