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

#include<bits/stdc++.h>
using namespace std;
struct node
{
string name;
int weight;
node* next_for_name;
node* next_For_weight;
};
void add_to_list(string n,int w,node** head_for_name,node** head_for_weight)
{
node* temp=new node;
temp ->name=n;
temp ->weight=w;
temp ->next_For_weight=NULL;
temp ->next_for_name=NULL;
  
node* t_head=(*head_for_name);
if(t_head==NULL) (*head_for_name)=temp;
else
{
node* prev=NULL;
while(t_head!=NULL && t_head ->name<n)
{
prev=t_head;
t_head=t_head ->next_for_name;
}
if(t_head==(*head_for_name))
{
temp->next_for_name=(*head_for_name);
(*head_for_name)=temp;
}
else
{
prev ->next_for_name=temp;
temp ->next_for_name=t_head;
}
}
  
t_head=*head_for_weight;
if(t_head==NULL) (*head_for_weight)=temp;
else
{
node *prev=NULL;
while(t_head!=NULL && t_head ->weight<w)
{
prev=t_head;
t_head=t_head ->next_For_weight;
}
if(t_head==(*head_for_weight))
{
temp->next_For_weight=(*head_for_weight);
(*head_for_weight)=temp;
}
else
{
prev ->next_For_weight=temp;
temp ->next_For_weight=t_head;
}
}
}

void print_list(node *head_for_name,node *head_for_weight)
{
cout<<"IN SORTED ORDER BY NAME"<<endl;
while(head_for_name!=NULL)
{
cout<<"NAME:"<<head_for_name->name<<" WEIGHT:"<<head_for_name->weight<<endl;
head_for_name=head_for_name->next_for_name;
}
  
cout<<endl<<"IN SORTED ORDER BY WEIGHT"<<endl;
while(head_for_weight!=NULL)
{
cout<<"NAME:"<<head_for_weight->name<<" WEIGHT:"<<head_for_weight->weight<<endl;
head_for_weight=head_for_weight->next_For_weight;
}
cout<<endl;
}
int main()
{
string name;
int weight;
node* head_for_name=NULL;
node* head_for_weight=NULL;
for(int i=0;i<15;i++)
{
cout<<"Enter name and weight of person "<<i+1<<": ";
cin>>name;
cin>>weight;
add_to_list(name,weight,&head_for_name,&head_for_weight);
print_list(head_for_name,head_for_weight);
}
}

snapshot:

1 #include<bits/stdc++.h> 2 using namespace std; 3 struct node 4- { string name; int weight; node next_for_name; node next_For_weight; no void add_to_list(string n, int w, node* head_for_name, node* head_for_weight) node temp=new node; temp->name=n; temp-weight=w; temp->next_for_weight=NULL; temp->next_for_name=NULL; node t_head=(head_for_name); if(t_head==NULL) (head_for_name)-temp; else node prev=NULL; while(t_head!=NULL && t_head ->namen) prev=t_head; t_head=t_head ->next_for_name; if(t_head==(head_for_name)) temp->next_for_name=("head_for_name); (head_for_name)-temp; else prev ->next_for_name=temp; temp->next_for_name=t_head; t_head="head_for_weight; if(t_head==NULL) (head_for_weight)-temp; else

t_head="head_for_weight; if(t_head==NULL) (head_for_weight)-temp; else node prev=NULL; while(t_head !=NULL && t_head ->weight<w) prev=t_head; t_head=t_head ->next_for_weight; if(t_head==(head_for_weight)) temp->next_for_weight=(head_for_weight); (head_for_weight)-temp; else prev ->next_For_weighttemp; temp->next_for_weight=t_head; 61 } 63 void print_list(node "head_for_name, node "head_for_weight) 64- cout<<"IN SORTED ORDER BY NAME"<<endl; while(head_for_name!=NULL) cout<<"NAME:"<<head_for_name->name" WEIGHT:"<<head_for_name->weight<<endl; head_for_name=head_for_name->next_for_name; cout<<endl<<"IN SORTED ORDER BY WEIGHT"<<endl; while(head_for_weight !=NULL) cout<<"NAME:"<<head_for_weight->name<<"WEIGHT:"<<head_for_weight-weight<<endl; head_for_weight-head_for_weight->next_for_weight; cout<<endl; 79 } 80 int main() 81 - {

head_for_name head_for_name->next_for_name; cout<<endl<<"IN SORTED ORDER BY WEIGHT"<<endl; while(head_for_weight] =NULL) cout<<"NAME:"<<head_for_weight->name<<"WEIGHT:"<<head_for_weight-weight<<endl; head_for_weight-head_for_weight->next_for_weight; cout<<endl; 80 int main() 81- 82 84 string name; int weight; node head_for_name=NULL; node head for weight=NULL; for(int i=0;i<15;i++) cout<<"Enter name and weight of person "<<i+1<<":"3 cin>>name; cin>>weight; add_to_list(name, weight, &head_for_name, &head_for_weight); print_list(head_for_name, head_for_weight); 94 }

OUTPUT:

Enter name and weight of person 1: ram 50 IN SORTED ORDER BY NAME NAME:ram WEIGHT:50 IN SORTED ORDER BY WEIGHT NAME :ram WEIGHT:50 Enter name and weight of person 2: arjun 75 IN SORTED ORDER BY NAME NAME:arjun WEIGHT:75 NAME :ram WEIGHT:50 IN SORTED ORDER BY WEIGHT NAME:ram WEIGHT:50 NAME:arjun WEIGHT:75 Enter name and weight of person 3: vishal 65 IN SORTED ORDER BY NAME NAME:arjun WEIGHT:75 NAME:ram WEIGHT:50 NAME : vishal WEIGHT: 65 IN SORTED ORDER BY WEIGHT NAME :ram WEIGHT:50 NAME:vishal WEIGHT: 65 NAME :arjun WEIGHT:75 Enter name and weight of person 4: darren 80 IN SORTED ORDER BY NAME NAME:arjun WEIGHT:75 NAME:darren WEIGHT:80 NAME:ram WEIGHT:50 NAME:vishal WEIGHT: 65 IN SORTED ORDER BY WEIGHT NAME :ram WEIGHT:50 NAME :vishal WEIGHT: 65 NAME :arjun WEIGHT:75 NAME:darren WEIGHT:80 Enter name and weight of person 5: 1