From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,abd120a1d5231d28
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Looking for a good Ada 95 book
Date: 1996/11/29
Message-ID: <dewar.849319148@merv>#1/1
X-Deja-AN: 201493819
references: <3290C33B.1772@cse.eng.lmu.edu> <dewar.848712351@merv>
 <577269$86o@felix.seas.gwu.edu> <329BD3A1.1CD7@accessus.net>
 <57i6n8$kvd@felix.seas.gwu.edu>
organization: New York University
newsgroups: comp.lang.ada
Date: 1996-11-29T00:00:00+00:00
List-Id: <comp.lang.ada>


Mike says

"But why on earth did that programmer use bubble sort in a compiler?:-)"

Perhaps it was the most appropriate algorithm. I often find that students
go to the opposite extreme, they insist on using bazookas to execute
cockroaches in their code. In fact there are many instances where a simple
bubble sort is qiute appropriate if you never expect very large sets of
data to sort, and you think they will in general be pretty much in order
(an example would be the component clauses in a record rep clause, if part
of your processing involved sorting them into order).