HOMEWORK 5: MULTI LINKED LISTS
NAME: < insert name >
TIME SPENT ON THIS ASSIGNMENT: <# of hours>
COLLABORATORS:
You must do this assignment on your own, as described in the CS2
Academic Integrity Policy. If you did discuss the problem or error
messages, etc. with anyone, please list their names here.
TESTING & DEBUGGING STRATEGY:
Please be concise!
ORDER NOTATION of the member functions of MultiLL?
(in terms of n, the number of elements currently in the list)
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? Did you implement the improvement?
Describe.
MISC. COMMENTS TO GRADER:
Optional, please be concise!