Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10 5/3/83; site utcsrgv.UUCP Path: utzoo!utcsrgv!dave From: dave@utcsrgv.UUCP (Dave Sherman) Newsgroups: net.sources,net.followup,net.flame Subject: Re: A Simple Bubble Sort Function, glass houses Message-ID: <4535@utcsrgv.UUCP> Date: Tue, 12-Jun-84 10:26:05 EDT Article-I.D.: utcsrgv.4535 Posted: Tue Jun 12 10:26:05 1984 Date-Received: Tue, 12-Jun-84 12:23:13 EDT References: <965@ihuxq.UUCP> <165@callan.UUCP> <131@godot.UUCP> Reply-To: dave@utcsrgv.UUCP (& Sherman) Organization: The Law Society of Upper Canada, Toronto Lines: 13 [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