comp.lang.ada
 help / color / mirror / Atom feed
From: "Jonny Ada" <surfer_rosa1134@hotmail.com>
Subject: QuickSort / Recursive Question
Date: Sun, 12 Jan 2003 03:35:54 -0000
Date: 2003-01-12T03:37:55+00:00	[thread overview]
Message-ID: <avqnuj$hj2$1@news8.svr.pol.co.uk> (raw)

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





             reply	other threads:[~2003-01-12  3:35 UTC|newest]

Thread overview: 4+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2003-01-12  3:35 Jonny Ada [this message]
     [not found] ` <gu7rva.ur3.ln@beastie.ix.netcom.com>
2003-01-12 12:47   ` QuickSort / Recursive Question Jonny Ada
2003-01-13 22:09     ` Stapler
2003-01-14 15:27     ` vKp
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox