Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site fortune.UUCP Path: utzoo!linus!vaxine!wjh12!genrad!decvax!decwrl!amd70!dual!fortune!ojs From: ojs@fortune.UUCP (Oliver Sharp) Newsgroups: net.sources Subject: Bubble sorts and such-like Message-ID: <3636@fortune.UUCP> Date: Wed, 20-Jun-84 01:02:31 EDT Article-I.D.: fortune.3636 Posted: Wed Jun 20 01:02:31 1984 Date-Received: Thu, 21-Jun-84 01:43:14 EDT Organization: Fortune Systems, Redwood City, CA Lines: 28 often faster, but the bubble sort is perfectly valid for teaching. I like to use mergesorts when I need fairly fast speed, since this is simple to implement and runs in order n*log(n). It isn't quite as good as quicksort or its derivatives, but it isn't bad. I just like the clean and simple implementation it allows and it is easy to explain to people in a couple of minutes. In general, though, I agree with the person who supported the person posting the article (sorry about all those person's). If you aren't interested in the article, don't read it. Any submission of interest to at least a couple of people should be encouraged - that is what the net is for, after all! (still working on a sign-off message) Oliver Sharp ....!fortune!ojs