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.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!uwm.edu!zaphod.mps.ohio-state.edu!usc!petunia!news
From: bgillett@polyslo.CalPoly.EDU (Brad Gillette)
Newsgroups: comp.lang.ada
Subject: Re: Got any good ADA assignments ?
Message-ID: <263f451f.625c@petunia.CalPoly.EDU>
Date: 2 May 90 20:37:51 GMT
References: <13137@udenva.cair.du.edu>
Organization: Cal Poly State Univ,CSC Dept,San Luis Obispo,CA 93407
List-Id: <comp.lang.ada>



I'm currently in a class of mostly senior and grad-level CSc
students being introduced to Ada.  An early assignment was to
implement Quick Sort in Ada along with the enhancement technicques
of median-of-three and 'default to insert sort' below a certain 
array size.

The next step was to modify the sort package to handle generic
types.  (The first step only sorted arrays of integers, but this
version must be able to handle various types of records with an
integer for a key.)

The last step will be to send the two sub-arrays resulting from
a Quick Sort partition to a parallel processor as two tasks.
Then as each of those sub-arrays is further partitioned, their
sub-arrays will be dealt with similiarly, and so on...
('course, you have to have a parallel processor for this last
step.)

bjg


-- 
Brad Gillette                       "Far be from us, Sire, the dangerous
bgillett.polyslo.CalPoly.EDU         novelty of thinking."  --Rector of the
                                     Univ. of Cervera to King Ferdinand.