From: Craig Carey <research@ada95.ijs.co.nz>
Subject: Re: A little help with Quicksort
Date: Thu, 24 Jan 2002 23:14:28 GMT
Date: 2002-01-24T23:14:28+00:00 [thread overview]
Message-ID: <94515uc4bed777l60tuqi9n7aie5ndsdhj@4ax.com> (raw)
In-Reply-To: 7__Y7.2188$cD4.3992@www.newsranger.com
On Thu, 03 Jan 2002 15:42:59 GMT, Ted Dennison<dennison@telepath.com>
wrote:
>A web page with a good discussion of Quicksort is
>http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/qsort.html
>
>
A merge sort Ada algorithm that uses tasks is shown here:
http://www.math.uni-siegen.de/ortolf/ada/adab40.jpg
It demonstrates use of tasks, and it halves the list, sorts it using
2 tasks, and then merges the 2 resulting lists.
prev parent reply other threads:[~2002-01-24 23:14 UTC|newest]
Thread overview: 7+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-01-01 22:25 A little help with Quicksort Mond
2002-01-02 0:53 ` chris.danx
2002-01-02 13:11 ` Ted Dennison
2002-01-02 22:22 ` Mond
2002-01-03 14:54 ` chris.danx
2002-01-03 15:42 ` Ted Dennison
2002-01-24 23:14 ` Craig Carey [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox