A Simple Bubble Sort Function
Doug Alan
nessus at mit-eddie.UUCP
Mon Jun 18 08:30:05 AEST 1984
> From: mickey at 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 at MIT-MC
"What does 'I' mean"?
More information about the Comp.sources.unix
mailing list