Question: Write a mergeSort() method for a linked list (singly linked!) Include the method in a LinkedList class with all other traditional methods, especially insertFirst and
Write a mergeSort() method for a linked list (singly linked!) Include the method in a LinkedList class with all other traditional methods, especially insertFirst and display. Include the following main for testing:
int main() { LinkedList theList; theList.insertFirst(44); theList.insertFirst(88); theList.insertFirst(66); theList.insertFirst(22); theList.insertFirst(55); theList.insertFirst(11); theList.insertFirst(33); theList.insertFirst(99); theList.displayList(); theList.mergesort(); theList.displayList(); }

Write a mergeSort() method for a linked list (singly linked!) Include the method in a LinkedList class with all other traditional methods, especially insertFirst and display. Include the following main for testing: int main() { LinkedList theList; theList.insertFirst (44); theList.insert First (88); theList.insertFirst (66); theList.insert First (22); theList.insertFirst (55); theList.insertFirst (11); theList.insertFirst (33); theList.insertFirst (99); theList.displayList(); theList.mergesort (); theList.displayList ()
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
