INNOVA Solutions

Recursion and Linked Lists

Presentation by Roger Connell at ADUG April 2005.


Early Pascal texts dealt extensively with managing dynamically allocated data via linked lists and with recursion in procedures. With Delphi the dynamic data tends to be allocated as objects and these objects are typically managed in containers such as TObjectList. In this presentation Roger looks at what can happen if you manage these objects as a linked list and how recursion can really make it rock.

For those who want to play some more the power points and the demonstration source code can be downloaded below.


Powerpoint, Demo Source Code

Other Innova Solutions Presentations at ADUG

ADUG Presentations

The company accepts no liability for any alleged or actual damage arising from the use of any of these products or this information.

For feedback on this information contact us :: enq at

Home           Australian Delphi Users Group

INNOVA Solutions Pty Ltd - ACN 081 449 836