Rewrite Exercise 5, making MergeLists a linked member function of the Sorted List ADT.

Exercise 5

Rewrite Exercise 4, making MergeLists an array-based member function of the Sorted List ADT.

Exercise 4

Write a client function that merges two instances of the Sorted List ADT using the following specification. MergeLists(SortedType list1, SortedType list2, SortedType& result)

 1. Write the prototype for MergeLists. 2. Write the function definition, using an array-based implementation. 3. Write the function definition, using a linked implementation. 4. Describe the algorithm in terms of Big-O.

Transcribed Image Text:

Function: Preconditions: Postconditions: Merge two sorted lists into a third sorted list. list1 and list2 have been initialized and are sorted by key using function ComparedTo. list1 and list2 do not have any keys in common. result is a sorted list that contains all of the items from list1 and list2.