Question

C++ Program

1. Read data for names and weights for 15 people.

2. Your program will build a list for the data maintained in ascending order based on both name and weight via a doubly linked list.

3. This dll will use one pointer to keep weights in sorted order, and use the other link to keep names on sorted order.

4. You need to build the list as you go maintaining this ordering, so at any time a print method was called it would print the related field in order. (This means nodes are added to the list in sorted order, elements are not added to the list followed by a sort called on the list.)

For example after 3 elements are added for (Name – Weight):

Michael – 275, Tom – 150, Abe – 200.

Output:

Names & weights sorted(ascending) by name. : Abe – 200, Michael – 275, Tom - 150

Names & weights sorted(ascending) by weight. : Tom – 150, Abe – 200, Michael - 275

Answer 1

//C++ program

#include<iostream>
using namespace std;

typedef struct Node{
   string name;
   double weight;
   struct Node* next;
   struct Node* prev;
}Node;

class List{
   private:
       Node*head;
   public:
       List(){
           head = NULL;
       }
       void insertByName(string name , double weight){
           Node* newNode = new Node;
           newNode->name = name;
           newNode->weight = weight;
           newNode->next = NULL;
           newNode->prev = NULL;
  
          Node* current,*prev;
  
       if (head == NULL) {
       head = newNode;
       return;
           }
       if (head->name >= name) {
       newNode->next = head;
       newNode->next->prev = newNode;
       head = newNode;
       return;
       }
  
   current = head;
   while (current != NULL && current->name < name) {
       prev = current;
       current = current->next;
           }
   current = prev;
  
   newNode->next = current->next;
  
   if (current->next != NULL)
   newNode->next->prev = newNode;
  
   current->next = newNode;
   newNode->prev = current;
}
  
void insertByWeight(string name , double weight){
           Node* newNode = new Node;
           newNode->name = name;
           newNode->weight = weight;
           newNode->next = NULL;
           newNode->prev = NULL;
  
          Node* current,*prev;
  
       if (head == NULL) {
       head = newNode;
       return;
           }
       if (head->weight >= weight) {
       newNode->next = head;
       newNode->next->prev = newNode;
       head = newNode;
       return;
       }
  
   current = head;
   while (current != NULL && current->weight < weight){
               prev = current;
   current = current->next; }
current = prev;
   newNode->next = current->next;
  
   if (current->next != NULL)
   newNode->next->prev = newNode;
  
   current->next = newNode;
   newNode->prev = current;
   }
  
void display(){
   Node* current = head;
   while(current!=NULL){
       cout<<current->name<<"-"<<current->weight;
       if(current->next != NULL)cout<<",";
       current = current->next;
       }
   }

};

int main(){
   int n=3;
   string name;
   double weight;
   List list1 , list2;
  
   for(int i=0;i<n;i++){
       cout<<"Enter name : ";
       cin>>name;
cout<<"Enter weight : ";
cin>>weight;
list1.insertByName(name,weight);
list2.insertByWeight(name,weight);
   }
  
   cout<<"\nNames & weights sorted(ascending) by name. :";
   list1.display();
  
   cout<<"\nNames & weights sorted(ascending) by weight. :";
   list2.display();
  
   return 0;
}

//sample output

C:\Users\lshuManish\Documents ordereeddll.exe Enter name : Michael Enter weight : 275 Enter name : Tom Enter weight : 150 Enter name : Abe Enter weight : 200 Names & weights sorted (ascending by name. :Abe-200. Michael-275,Tom-150 Names & weights sorted(ascending> by weight. : Tom-150, Abe-200, Michael-275 Process exited after 28.25 seconds with return value o Press any key to continue ...