bgillett@polyslo.CalPoly.EDU (Brad Gillette) (05/03/90)
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.