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!watmath!clyde!burl!ulysses!mhuxl!ihnp4!mit-eddie!nessus From: nessus@mit-eddie.UUCP (Doug Alan) Newsgroups: net.sources,net.followup,net.flame Subject: Re: A Simple Bubble Sort Function, glass houses Message-ID: <2096@mit-eddie.UUCP> Date: Mon, 11-Jun-84 08:11:54 EDT Article-I.D.: mit-eddi.2096 Posted: Mon Jun 11 08:11:54 1984 Date-Received: Mon, 11-Jun-84 23:54:53 EDT References: <965@ihuxq.UUCP> <165@callan.UUCP> <131@godot.UUCP> Organization: MIT, Cambridge, MA Lines: 11 Yes. And if you're too lazy to do a quick sort or merge sort or some n*log(n) sort (though it shouldn't be very difficult) you could at LEAST do a straight insertion sort which is just as easy as a bubble sort or selection sort and always as fast or faster. -- -Doug Alan mit-eddie!nessus Nessus@MIT-MC "What does 'I' mean"?