QuickSort / Recursive Question

QuickSort / Recursive Question

[Jonny Ada]

Ok. Ok. I'm doing my homework...

Basically i've been given a task to do and i'm a little confused with the
language of the question (i know it's not really relevant here).

I have a (small) linked list of integers and i've been asked to:

"Break it into two small lists (one bigger than a vaule one smaller blah
blah...). Sort the two smaller lists RECURSIVELY and then reassemble them
into one sorted list."

I've done the 'two smaller lists' bit but i'm not sure what is meant by
'recursive'. i know about calling a procedure from within the same procedure
and can do that but should i be breaking these two smaller lists into even
more smaller lists or sorting them by looking at the values and doing an
insertion sort or something.

I'd appreciate some help!

Thanks in advance!

Iain

Re: QuickSort / Recursive Question

[Jonny Ada]

That's brilliant! Thanks!

Re: QuickSort / Recursive Question

[Stapler]

In article <avsj4k$vit$1@news8.svr.pol.co.uk>, Jonny Ada wrote:
> That's brilliant! Thanks!
> 
>

What's even more brilliant is the treatment Donald Knuth gives the
subject in The Art of Computer Programming. Look in the volume "Sorting
and Searching".

Stapler

Re: QuickSort / Recursive Question

[vKp]

"Jonny Ada" <surfer_rosa1134@hotmail.com> wrote in message
news:avsj4k$vit$1@news8.svr.pol.co.uk...
> That's brilliant! Thanks!
>
Any chance of posting the final algorithm you got? I would find it quite
useful for a project I'm doing.