HOMEWORK 5: LINKED LIST OPERATIONS


NAME:  < insert name >


WHICH FUNCTIONS DID YOU SUCCESSFULLY IMPLEMENT?


FOR EACH FUNCTION, WHAT ARE THE WORST-CASE RUN TIMES (USING THE ORDER
NOTATION)?  YOU MAY ASSUME THAT EACH new OPERATION REQUIRES O(1)
TIME. 


GIVE A BRIEF OUTLINE OF THE ALGORITHM YOU USED FOR THE ordered_merge FUNCTION


MISC. COMMENTS TO GRADER:  
This part is optional.  Use it to explain any problems that you know about.   Be concise.