Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site pucc-i
Path: utzoo!linus!vaxine!wjh12!genrad!decvax!ucbvax!ucbcad!tektronix!uw-beaver!cornell!vax135!houxz!houxm!ihnp4!inuxc!pur-ee!CS-Mordred!Pucc-H:Pucc-I:ags
From: ags@pucc-i
Newsgroups: net.sources,net.followup,net.flame
Subject: Re: A Simple Bubble Sort Function
Message-ID: <318@pucc-i>
Date: Sun, 17-Jun-84 14:18:56 EDT
Article-I.D.: pucc-i.318
Posted: Sun Jun 17 14:18:56 1984
Date-Received: Thu, 21-Jun-84 01:40:42 EDT
References: <2699@ecsvax.UUCP> <1356@proper.UUCP>
Organization: Purdue University Computing Center
Lines: 10

>  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).

You could also say that BASIC is quite efficient for N <= 10 (where N is
the number of lines in the program).
-- 

Dave Seaman			"My hovercraft is full of eels."
..!pur-ee!pucc-i:ags