Objectives:
Practice recursive functions in both array and linked list
Overview
Go back to complex number in Lab 2 where you store more than 15 complex numbers in an array.
Find the largest complex number in the array using recursive method. The largest number is the one who has the largest (real)*(real) + (img)*(img)
Go back to forward link list in Lab 3 where you store many stocks in a link list.
Write the reverse print function using recursive method.
Discussions
The textbook has very detail implementation of both routines. You're encouraged to reference it.
In order to easily compare complex numbers, do you think overloading a less than (<) or greater than (>) operator will make code cleaner? The example used in linked list insertion page has similar operator overloading to facilitate in-order insertion.
If you want more, do the tower of Hanoi and count the number of recursions ( you can validate your result with wikipedia's number).