Construct algorithms using a static implementation of a list.


Teaching Note:

Lists will be restricted to singly linked types. Methods that should be known are add (head and tail), insert (in order), delete, list, isEmpty, isFull.


Sample Question:


JSR Notes:

**** A key question here (to which I think I have the correct answer) is how do you make a static implementation of a list?

Answer: use arrays - see the video at 5.1.10.