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=0.6 required=5.0 tests=BAYES_20,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,13c8b7bd607f1ccc,start
X-Google-Attributes: gid103376,public
From: "W. Wesley Groleau (Wes)" <wwgrol@PSESERV3.FW.HAC.COM>
Subject: Feeling out of sorts about learning styles
Date: 1996/08/21
Message-ID: <9608212203.AA14982@most>#1/1
X-Deja-AN: 175756932
sender: Ada programming language <INFO-ADA@LISTSERV.NODAK.EDU>
comments: To: info-ada%listserv.nodak.edu@emcee.com
mailer: Elm [revision: 70.85]
newsgroups: comp.lang.ada
Date: 1996-08-21T00:00:00+00:00
List-Id: <comp.lang.ada>


The first time I saw quicksort in a high-level language, it took a little
while to understand it, even though I had been given a verbal explanation.

Robert's two-line explanation of the algorithm as applied to a deck of
cards was instantly clear.

Tim's assembly approaches the other extreme.  Knowing assembler has its
advantages, but it will NEVER make quicksort easier to understand!

But neither speed, simplicity, nor size (table space) is necessarily
the criteria for selecting an algorithm...

The best algorithm for sorting a deck of cards is the most fun:

until sorted, loop
  Play solitaire!
  if deadlock then
    cheat
  end if
  if still deadlocked
    report missing cards or something
  end if
end loop;

(All work and no play...)

---------------------------------------------------------------------------
W. Wesley Groleau (Wes)                                Office: 219-429-4923
Hughes Defense Communications (MS 10-40)                 Home: 219-471-7206
Fort Wayne,  IN   46808                  (Unix): wwgrol@pseserv3.fw.hac.com
---------------------------------------------------------------------------