Unfortunately the pseudocode of FunctionB is broken - twice - and I think the answer might be iffy. <br><br>1. The line <b>If A[iCount] > compItem</b> has an ELSE but no terminating END IF.<br><br>2. The FOR loop has no terminating NEXT or END FOR.<br>
<br>3. A16 asks how many times functionB will be called - the solution says 3 times.<br><br>Recursion always does my head in so I have not deskchecked it, but it seems to me that the RETURN line actually calls functionB twice (once for arrLeft and once for arrRight) so I'd say if that line is executed 3 times, FunctionB would actually be called 6 times... I'm open to repudiation :-)<br>
<br>Then it's more probably 7 times - once for the initial functionB call from outside, then 3x2 times during recursion.<br><br><br>Anyway, it's rather too hard for SD, I'd say: recursion should not be needed for SD exams. VCAA papers have not been so tough (so far!)<br>
<br clear="all"><br>-- <br>Mark Kelly<br>Manager of ICT, Reporting, IT Learning Area<br>McKinnon Secondary College<br>McKinnon Rd McKinnon 3204, Victoria, Australia<br>Direct line / Voicemail: +613 8520 9085, Fax +613 9578 9253<br>
<a href="mailto:kel@mckinnonsc.vic.edu.au" target="_blank">kel@mckinnonsc.vic.edu.au</a> << use this, not Edumail please!<br>VCE IT Lecture Notes: <a href="http://vceit.com" target="_blank">http://vceit.com</a><br>
Moderator: IT Applications Edulist<br>
<br>--<br>The illiterate of the 21st century will not be those who cannot read and write, but those who cannot learn, unlearn and relearn - Alvin Toffler.<br><br><br>