Lisp Lists
This section is based on parts 8, 9 and 10 of the notes,
Lisp Lists,
Sorting Lisp Lists,
and
Recursion.
Practical exercises supporting this section are in
Exercise sheet 4.
When you have completed this section you should be able to:
- Describe the concept of a "Lisp list" in terms of the operations possible
on objects of that type
- Write code which manipulates Lisp lists using iteration
- Write code which manipulates Lisp lists using recursion
- Illustrate how various sorting algorithms work using Lisp lists
- Illustrate how recursion works, using diagrams of environments
- Identify instances of recursion which are tail recursion, and
understand how they can be converted to iteration
Matthew Huntbach
Last modified: 30 June 2006