HOMEWORK 5: MULTI LINKED LISTS


NAME:  < insert name >


COLLABORATORS AND OTHER RESOURCES:
List the names of everyone you talked to about this assignment
(classmates, TAs, ALAC tutors, upperclassmen, students/instructor via
the forum, etc.), and all of the resources (books, online reference
material, etc.) you consulted in completing this assignment.

< insert collaborators / resources >

Remember: Your implementation for this assignment must be done on your
own, as described in "Collaboration Policy and Academic Integrity".



ESTIMATE OF # OF HOURS SPENT ON THIS ASSIGNMENT:  < insert # hours >



TESTING & DEBUGGING STRATEGY:
Please be concise!  



BIG O NOTATION of the member functions of MultiLL?
(in terms of n, the number of elements currently in the list)
Include a short, written justification for any non-trivial functions.

default constructor

copy constructor

assignment operator

destructor

size

empty

clear

add

erase

begin_chronological

end_chronological

begin_sorted

end_sorted

begin_random


ITERATOR INVALIDATION:
In what cases will iterators of the MultiLL be invalidated?  Justify
the need for each of the restrictions placed on your implementation.




EXTRA CREDIT: 
Which function in your implementation can be improved by a
non-insertion sort sorting method?  Describe.




MISC. COMMENTS TO GRADER:  
Optional, please be concise!