The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 398 Weeks Ago, 4 Days Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
A list ADT is to be extended by the addition of the member function Split Lists, which has the following specification:
Â
SplitLists(ListType& list1, ListType& list2, ItemType item)
Function: Divides self into two lists according to the key of item. Precondition: Self has been initialized. Postconditions: list1 contains all the elements of self  whose keys are less than or equal to item’s.  list2 contains all the elements of self  whose keys are greater than item’s.
You may assume that Unsorted Type and Sorted Type are tem plated classes and that the relational operators are defined for Item Type.
Â
a. Implement SplitLists as a member function of the Unsorted List ADT.
Â
b. Implement SplitLists as a member function of the Sorted List ADT.
c. Compare the algorithms used in parts (a) and (b).
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll