Question

#C++, Programming: Program Design Including Data Structures, 7^th Edition, it is too long so i can't add the these two file.(unorderedlinked.h and linkedlist.h) as well as the output

1. Please use the file names listed below since your file will have the following components:

2. Ch16_Ex5_MainProgram.cpp - given file
   
   
   //22 34 56 4 19 2 89 90 0 14 32 88 125 56 11 43 55 -999

   #include
   #include "unorderedLinkedList.h"

   using namespace std;
   
   int main()
   {
   unorderedLinkedList list, subList;
   
   int num;                                                                                                                       

               cout << "Enter numbers ending with -999" << endl;                                                                                                                     
   cin >> num;                                                                                                     

               while (num != -999)                                                                                          
   {
   list.insertLast(num);                                                                  
   cin >> num;                                                                                                     
   }

               cout << endl;                                                                                                   

               cout << "List: ";                                                
   list.print();                                                                                                        
   cout << endl;                                                                                                               
   cout << "Length of the list: " << list.length() << endl;                                                                                                      

               list.divideMid(subList);

               cout << "Lists after splitting list" << endl;

               cout << "list: ";
   list.print();                                                                                                        
   cout << endl;                                                                                                               
   cout << "Length of the list: " << list.length() << endl;                  

               cout << "sublist: ";
   subList.print();                                                                                                  
   cout << endl;                                                                                                               
   cout << "Length of subList: " << subList.length() << endl;
   system("pause");
   return 0;                                                          
   }

   linkedList.h
   unorderedLinkedList.h

3. Dividing a linked list into two sublists of almost equal sizes:
   1. Add the operation divideMid to the class linkedListType as follows:

      void divideMid(linkedListType &sublist);
      //This operation divides the given list into two sublists
      //of (almost) equal sizes.
      //Postcondition: first points to the first node and last
      //          points to the last node of the first
      //          sublist.
      //          sublist.first points to the first node
      //          and sublist.last points to the last node
      //          of the second sublist.
      Consider the following statements:

      unorderedLinkedList myList;
      unorderedLinkedList subList;

   2. Suppose myList points to the list with elements 34 65 27 89 12 (in this order). The statement:

      myList.divideMid(subList);

      divides myList into two sublists: myList points to the list with the elements 34 65 27, and subList points to the sublist with the elements 89 12.

      Write the definition of the function template to implement the operation divideMid. Also, write a program to test your function.

Answer 1

Hi, since you have not provided "unorderedlinkedlist.h" file i have to write code with assumption that unorderedlinkedlist.h has a class which gives implementation of unorderedLinkedList class and unorderedLinkedList class contains a headPtr member which points to the head of linkedList and each member in the linked list has a "next" pointer which points to the next node in the linked list

Based on above assumption here is the implementation of divideMid(linkedListType &sublist); method

void divide(linkedListType &subList)
{
//please change the below line based on your class structure
//logic of program will remain the same
Node *temp = this.headPtr;
int len=0;//finding the length of the linkedListType
while(temp!=NULL)
{
len++; //incrementing for length
temp=temp->next;
}
//ceil function is present in cmath library
// using it to find if length is odd number
int mid = ceil((float)len/2);
temp=this.headPtr;
int i=1; //counter till the mid node
//itearting the list till we find the middle node
while(temp!=NULL && i<mid )
{
i++;
temp=temp->next;
}
//setting mid to be the head of new linked list
subList.head=temp;
//setting the mid to be the end of first linked list
temp->next=NULL;
  
  
}