C++ Plus Data Structures: Chapter 4 Exercise 6:

REWRITE THE BELOW QUESTION making MergeLists a linked member function of the Sorted List ADT.

but FIRST:

REWRITE THE BELOW QUESTION making MergeLists an array-based member function of the Sorted List ADT.

Write a client functin that merges two instances of the Sorted List ADT using the following specification:

Preconditions: list1 and list2 have been initiaize and are sortdbykey using function ComparedTo.

list1 and list2 do not have any keys in common.

Postconditions: result is a sorted list that contains all of the items from list1 and list2.

A) write the prototype for MergeLists.

B) Write the function definition, using an array-based implementation.

C) Write the function definition, using a linked implementation.

D) Describe the algorithm in terms of Big-O.