Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site proper.UUCP Path: utzoo!linus!vaxine!wjh12!genrad!decvax!ucbvax!ucbcad!tektronix!uw-beaver!cornell!vax135!houxz!houxm!ihnp4!zehntel!dual!proper!mickey From: mickey@proper.UUCP Newsgroups: net.sources,net.followup,net.flame Subject: Re: A Simple Bubble Sort Function Message-ID: <1356@proper.UUCP> Date: Wed, 13-Jun-84 13:13:51 EDT Article-I.D.: proper.1356 Posted: Wed Jun 13 13:13:51 1984 Date-Received: Tue, 19-Jun-84 01:21:53 EDT References: <2699@ecsvax.UUCP> Organization: Proper UNIX, San Leandro, CA Lines: 15 >> Wirth states, " ... in fact, the Bubblesort has hardly anything to >> recommend it except its catchy name. " >> page 68 of Algorithms + Data Structures = Programs . >> >> ...decvax!mcnc!ecsvax!mas >> That statement actually came from Knuth. See page 111 of Volume 3 from "The Art of Computer Programming". I read somewhere, though i am sorry i can't give a reference, that bubble sort is quite efficient for N <= 10 (where N is the number of records to be sorted). M. Thompson