Please do a flowchart for the c++ linked list programme given.   Hide quoted text void viewstudents(struct student *stt) { struct student *st=stt,*temp; char n[20]; int i=1; if(stt==NULL) cout<<"\nNo data"; else { while(st!=NULL)//sorting { temp=st->next; while(temp!=NULL) { if(strcmp(st->id,temp->id)>0) { strcpy(n,st->name); strcpy(st->name,temp->name); strcpy(temp->name,n); strcpy(n,st->id); strcpy(st->id,temp->id); strcpy(temp->id,n); strcpy(n,st->addr); strcpy(st->addr,temp->addr); strcpy(temp->addr,n); strcpy(n,st->ph); strcpy(st->ph,temp->ph); strcpy(temp->ph,n); strcpy(n,st->dob); strcpy(st->dob,temp->dob); strcpy(temp->dob,n); strcpy(n,st->cls); strcpy(st->cls,temp->cls); strcpy(temp->cls,n); } temp=temp->next; } st=st->next;     }      st=stt;        cout<<"\nNo.\tName\t\tID\t\tAddress\t\tPhone No.\t\tD.O.B\t\tClass"; while(st!=NULL) {         cout<<"\n"<name<<"\t"<id<<"\t"<addr<<"\t"<ph<<"\t"<dob<<"\t"<cls; st=st->next; i++; } } }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Please do a flowchart for the c++ linked list programme given.
 
Hide quoted text
void viewstudents(struct student *stt)
{
struct student *st=stt,*temp;
char n[20];
int i=1;
if(stt==NULL)
cout<<"\nNo data";
else
{
while(st!=NULL)//sorting
{
temp=st->next;
while(temp!=NULL)
{
if(strcmp(st->id,temp->id)>0)
{
strcpy(n,st->name);
strcpy(st->name,temp->name);
strcpy(temp->name,n);
strcpy(n,st->id);
strcpy(st->id,temp->id);
strcpy(temp->id,n);
strcpy(n,st->addr);
strcpy(st->addr,temp->addr);
strcpy(temp->addr,n);
strcpy(n,st->ph);
strcpy(st->ph,temp->ph);
strcpy(temp->ph,n);
strcpy(n,st->dob);
strcpy(st->dob,temp->dob);
strcpy(temp->dob,n);
strcpy(n,st->cls);
strcpy(st->cls,temp->cls);
strcpy(temp->cls,n);
}
temp=temp->next;
}
st=st->next;
    }
     st=stt;
       cout<<"\nNo.\tName\t\tID\t\tAddress\t\tPhone No.\t\tD.O.B\t\tClass";
while(st!=NULL)
{
 
      cout<<"\n"<<i<<"\t"<<st->name<<"\t"<<st->id<<"\t"<<st->addr<<"\t"<<st->ph<<"\t"<<st->dob<<"\t"<<st->cls;
st=st->next;
i++;
}
}
}
Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Mergesort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education