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=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM,XPRIO autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,fc4855e42f2098d6,start X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-01-11 19:37:55 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!iad-peer.news.verio.net!news.verio.net!newsfeed.icl.net!newsfeed.fjserv.net!diablo.theplanet.net!news.theplanet.net!not-for-mail From: "Jonny Ada" Newsgroups: comp.lang.ada Subject: QuickSort / Recursive Question Date: Sun, 12 Jan 2003 03:35:54 -0000 Message-ID: NNTP-Posting-Host: 62.137.106.45 X-Trace: news8.svr.pol.co.uk 1042342675 18018 62.137.106.45 (12 Jan 2003 03:37:55 GMT) NNTP-Posting-Date: 12 Jan 2003 03:37:55 GMT X-Complaints-To: abuse@theplanet.net X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Xref: archiver1.google.com comp.lang.ada:32930 Date: 2003-01-12T03:37:55+00:00 List-Id: 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