A Sorted List ADT is to be extended by the addition of function SplitLists, whic

A Sorted List ADT is to be extended by the addition of function SplitLists, which has the following specifications: SplitLists(SortedType list, ItemType item, SortedType& list1, SortedType& list2) Function: Divides list into two lists according to the key of item. Preconditions: list has been initialized and is not empty. Postconditions: list1 contains all the items of the list whose keys are less than or equal to item’s key; list2 contains all the items of list whose keys are greater than item’s key. A) Implement SplitLists as a member function of the array-based Sorted List ADT. B) Implement SplitLists as a member function of the linked Sorted List ADT. C) Compare the algorithms used in (A) and (B). D) Implement SplitLists as a client function of the array-based Sorted List ADT. E) Implement SplitLists as a client function of the linked Sorted List ADT.

Posted in C++

Place this order or similar order and get an amazing discount. USE Discount code “GET20” for 20% discount