Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site teldata.UUCP Path: utzoo!watmath!clyde!burl!hou3c!hocda!houxm!houxz!vax135!floyd!harpo!decvax!ucbvax!ucbcad!tektronix!uw-beaver!teltone!teldata!tac From: tac@teldata.UUCP Newsgroups: net.flame Subject: Re: A Simple Bubble Sort Function Message-ID: <383@teldata.UUCP> Date: Mon, 11-Jun-84 11:32:34 EDT Article-I.D.: teldata.383 Posted: Mon Jun 11 11:32:34 1984 Date-Received: Thu, 14-Jun-84 01:26:29 EDT References: <965@ihuxq.UUCP>, <165@callan.UUCP> Organization: Teltone Corp., Kirkland, WA Lines: 32 , (sop to the blank line eaters--consider it a religious sacrifice) >> From: geoff@callan.UUCP >> Subject: Re: A Simple Bubble Sort Function >> >> Jack Purdum is rapidly getting a reputation as an idiot with me. I thought >> that by now *EVERYBODY* knew that the bubble sort is for cretins. If you >> want a quick simple sort, write a "selection sort": search 0 thru n for the >> largest item and swap it with the item in slot n; repeat with n=n-1 until >> done. This is exactly the effect that the bubble sort achieves (think about >> it for a while if you aren't sure), but without all the unnecessary exchanges. >> >> Moral: Don't waste your effort optimizing the wrong solution to the problem. >> >> Geoff Kuenning >> Callan Data Systems >> ...!ihnp4!wlbr!callan!geoff >> Yah, who wants to sort bubbles anyway. What a rediculous thing to spend your time on. Take that Jack. Say, though, Geoff, is that the only morals you have? From the Soapbox of Tom Condon {...!uw-beaver!teltone!teldata!tac} A Flame A Day Keeps The Ice Away. DISCLAIMER: The opinions expressed herein are those of everyone who matters, but not necessarily anyone you know, and most certainly not my employers!