Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site mit-eddie.UUCP
Path: utzoo!linus!vaxine!wjh12!genrad!mit-eddie!nessus
From: nessus@mit-eddie.UUCP (Doug Alan)
Newsgroups: net.sources,net.followup,net.flame
Subject: Re: A Simple Bubble Sort Function
Message-ID: <2172@mit-eddie.UUCP>
Date: Sun, 17-Jun-84 18:30:05 EDT
Article-I.D.: mit-eddi.2172
Posted: Sun Jun 17 18:30:05 1984
Date-Received: Tue, 19-Jun-84 01:28:52 EDT
References: <2699@ecsvax.UUCP> <1356@proper.UUCP>
Organization: MIT, Cambridge, MA
Lines: 15

>	From: mickey@proper.UUCP

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

The bubble sort is efficient for N <= 10, but the straight insertion
sort, which is easier to do, is more efficient.
-- 
				-Doug Alan
				 mit-eddie!nessus
				 Nessus@MIT-MC

				"What does 'I' mean"?