Question

I just need an algorithm for this please! I have C++ code for it but I dont know how to creat an algorithm ..

CSE 1311-Project 4 Part I: Create and print out the two arrays: (Be sure to do this first) You are allowed to hard code these arrays into your program. You can also put the data into a file and read the information into the program. The data is as follows: 150 250 Anne Bob Ralph 305 Tim Barbara85 Jane Steve 210 Tom Mike Shiley 155 Pam Frank 160 180 165 130 Part II: The elevators in our building have an 1100 lb. load limit. Determine which people in the list above get on the elevator. Print their names, weights, total weight, and how many got on Part III: Rearrange these people in asscending sequence by weight and print the two arrays Determine again how many may ride the elevator, printing out their names, weights, total weight and the number of how many people got on. Part IV: Rearrange these people in descending sequence by name (USE A DIFFERENT SORT ALGORITHM THAN THE ONE YOU USED IN PART III) and print the two arrays. Determine again how many may ride the elevator, printing out their names, weights, total weight and the number of how many people got on Part V: Have the program determine which method allowed the most people to get on the elevator. The program should compare the three different counts of how many people got on the elevator in each of the scenarios above with the weight array as given, with the weight array in ascenging order, with the name array in descending order This program should include: 2 different sort functions Part II The elevators in our building have an 1100 lb. load limit. Determine which people in the list above get on the elevator. Print their names, weights, total weight, and how many got on. Part III Rearrange these people in asscending sequence by weight and print the two arrays Determine again how many may ride the elevator, printing out their names, weights, total weight and the number of how many people got on Part IV: Rearrange these people in descending sequence by name (USE A DIFFERENT SORT ALGORITHM THAN THE ONE YOU USED IN PART III) and print the two arrays. Determine again how many may ride the elevator, printing out their names, weights, total weight and the number of how many people got on Part V: Have the program determine which method allowed the most people to get on the elevator. The program should compare the three different counts of how many people got on the elevator in each of the scenarios above - with the weight array as given, with the weight array in ascenging order, with the name array in descending order 2 different sort functions a function to determine how many people get on the elevator (will be called 3 times) .a print function which prints both arrays (include a size parameter and it can be called 6 times) Make sure all methods are writen to handle n elements, not just 12. You can pass 12 from main to n in the method/function Turn in: The assignment sheet, algorithm for main, source code, output and Academic Honesty Promise EXTRA CREDIT: Read the data from a file and put the results on an output file. Print the output file using Notepad or some other editor

Answer 1

Algorithm step 1:Declare the function name ascendinglist_elevator () step 2:delcare the variable limit,count and temp value initilaize to 0 step 3:using for loop to check the condition and print the if (weight-1 [ İ ] <weight-1 [minimum] ) weight,total weight minimum 1 int tempvalue-weight_1[pl; weight 1Ipl-weight 1 [minimum]; weight 1[minimum]-tempvalue; string tempvaluel-name1 [p] name1 [pl name1 [minimum]; name 1 [minimum] =tempvalue1; step 4:display the selection sort ascending order if ( (tempvalue-total +weight-1 [j ] ) <=liftlinit ) tempvalue-total=tempvalue-total+weight-1 [j ] ; coutくくsetw/10)<< "\nName :"<<name 1 [j] << " weight "<<weight_1j]; cnttt;

step 5:print total weight and peron count step 6:create the function descendinglist_elevator (string namel [,int weight_1[1,int lengl) step 7: check the condition and display the values if (weight 1 [i]<weight 1 [i+1]) int tempvalue-weight 1[il weight 1[il-weight 1[i+1] weight_1 [i+1] tempvalue; string tempvaluel-name1 [i]i name 1 [ İ ]-name 1 [ İ+1 ] ; name1[it1]-tempvalue1; step 8 print the total weiht and person count step 9 create a function list_elevator (string name1[],int weight_1[],int leng1)

step 10:delcare the variable liftlimit,tempvalue and count step 11: check the condition t。display the t tal we ight and count if ( (tempvalue_total+weight_1[i]) <liftlimit) tempvalue-total-tempvalue-tota 1+weight-I [ i ] ; coutくくsetw (10)<< "\nName :"<<name 1 [i]<<" weight : "<<weight 1[i]; step 12:main function delcare the string name["Anne", "Bob", "Ralph", "Tim", "Barbara", "Jane", "Steve", "Tom", "Mike", "Shirley", "Pam", "Frank" declare the weight 150,250,305,250,85,160,180,210,165,155,125, 130; step 13:call the function and stored in the cnt1,cnt2, cnt3 step 14:compare the three different count from the elevator step 15 display the count values

code

solution

#include <iostream> #include <string> #include <10manip> //#include <array> using namespace std; int ascendinglist_elevator (string name1[],int weight_1[],int leng1) int liftlimit=1100, tempvalue-total=0,cnt=0; for (int p=0;p<leng1-1;p++) int minimum = p; if (weight 1 [i]<weight 1 [minimum]) minimumi; int temp value=weight-1 [p]; weight 1 [p]=weight 1 [minimum]; weight_1 [minimum]-tempvalue; string tempvalue1-name1 [p]; name1 [plFnamel [minimum]; name 1 [minimum] temp valuel; cout<<" \n\n- SELECTION SORT ASCENDING ORDER" for (int 1-0 ;1<leng 1 ;1++)

coutくくsetw (10)<<"\nName "<<weight_1[i] :"くくname 1 [i]<<" weight : cout<<" nn-OUTPUT FOR ASCENDING ORDER" for (int j=0;jcleng1;j++) if ( (tempvalue_total+weight_1[j])<-liftlimit) tempvalue total-tempvalue totaltweight 111 coutくくsetw/10)<< "\nName :"<<name 1 [J]<< " weight "<<weight_11j1: cnttt; cout<< "\n "<<cnt weight >Total : "くくtemp value tal<< " t Person cnt : return cnt int descendinglist_elevator (string name1[],int weight_1[],int leng1) int liftlimit-1100, tempvalue_total-0, cnt-o for (int p=0 ; p< leng1-1;p++) for (int 1-0 ;ikleng1-1;1++) if (weight_1 [i]<weight_1 [i+1])

int tempvalue-weight_1[i]; weight 1[il-weight 1[i+1] weight-1 [i+1 ] =tempvalue ; string tempvalue1-namel [i]; name 1 [ =name 1 [ ¡+1 ] ; name1[it1]-tempvaluel; cout<<" nnBUBBLE SORT DESCENDING for (int ORDER"; 1-0 ;1<leng 1 ;1++) coutくくsetw (10)<<"\nName :"くくname 1 [i]<<" weight : "<<weight cout<<" \n\noUTPUT FOR DESCENDING for (int j弌门くleng1;j++) ORDER INPUT-" if ( (tempvalue-total +weight-1 [j ] ) <=lift limit ) tempvalue total-tempvalue totaltweight 1ri1 coutくくsetw ( 10 ) << "\nName :"くくname 1 [j]<<" weight : "<Kweight_11j1i cout<<"n---Total weight :"<tempvalue_total<<" Person cnt: "<<cnt return cnt:

int list_elevator (string name1 [1,int weight_1[1,int leng1) int liftlinit-1100, tempvalue-total=0, cnt=0; cout<<" nn-OUTPUT FOR DIRECT GIVEN INPUT-"; for (int 1-0 ;1<leng1;1++) if ( (tempvalue_total+weight_1[i])<liftlimit) tempvalue_total-tempvalue_total+weight_1[i] coutくくsetw (10)<< "\nName :"<<name 1 [i]<<" weight : "<<weight 1[i]; cout<< "\n "<<cnt >Total weight : "くくtemp value tal<< " t Person cnt : return cnt int main() string name [ ] ={ "Anne" , "Bob" , "Ralph", "Tim", "Barbara" , "Jane", "Steve", "Torn ", "Mike", "Shirley", "Pam", "Frank" int weight[] ={150,250, 305,250, 85, 160, 180,210, 165,155, 125,130); int cnt1,cnt2, cnt3,len; len-(sizeof (weight)/sizeof (int)); for (int 1-0 ;İ<len;i++)

coutくくsetw(10)<<"\nName :"<<name [i]<<" weight "<<weight [i]; : cnt 1-11stelevator (name, weight, len) ; cnt2-descendinglist_elevator (name, weight,len) cnt3-ascendinglist_elevator (name, weight,len) if (cnt1>cnt2&&cnt1>cnt3) - cout<<"InlnDirect Input met hod is BEST"<kent1; cout<<"n nDescending Order Input method is BEST"<<cnt2; else if (cnt3>cnt1&&t3>cnt2) cout<<"n\nAscending Order Input method is BEST with cnt of Person : ".e.etzuì.3ぶ return 0;

output

Name :Anne weight 150 Name :Bob weight 250 Name Ralph weight: 305 Name :Tim weight 250 Name :Barbara weight 85 Name :Jane weight : 160 Name :Steve weight 180 Name :Tom weight : 210 Name :Mike weight : 165 Name :Shirley weight 155 Name :Pam weight : 125 Name :Frank weight 130 -OUTPUT FOR DIRECT GIVEN INPUT- Name Anne weight 150 Name :Bob weight 250 Name Ralph weight: 305 Name :Tim weight : 250 Name :Barbara weight 85 -->Total weight :1040 Person cnt: 5

BUBBLE SORT DESCENDING ORDER Name Ralph weight: 305 Name :Bob weight 250 Name :Tim weight : 250 Name :Tom weight : 210 Name :Steve weight 180 Name :Mike weight 165 Name :Jane weight : 160 Name :Shirley weight 155 Name :Anne weight 150 Name :Frank weight 130 Name :Pam weight : 125 Name :Barbara weight85 OUTPUT FOR DESCENDING ORDER INPUT- Name Ralph weight: 305 Name :Bob weight 250 Name Tim weight 250 Name :Tom weight : 210 Name :Barbara weight 85 >Total weight :1100 Person cnt : 5 SELECTION SORT ASCENDING ORDER Name :Barbara weight 85 Name :Pam weight : 125 Name :Frank weight 130 Name :Anne weight 150 Name :Shirley weight 155 Name :Jane weight : 160

Name :Mike weight: 165 Name :Steve weight: 180 Name Tom weight 210 Name Tim weight250 Name :Bob weight 250 Name :Ralph weight: 305 -OUTPUT FOR ASCENDING ORDER Name :Barbara weight85 NamePam weight 125 Name iFrank weight : 130 Name Anne weight 150 Name :Shirley weight: 155 Name Jane weight: 160 Name :Mike weight: 165 >Total weight :970 Person cnt 7 Ascending Order input method is BEST with cnt of Per

copyable code

#include <string>

#include <iomanip>

//#include <array>

using namespace std;

int ascendinglist_elevator(string name1[],int weight_1[],int leng1)

{

int liftlimit=1100,tempvalue_total=0,cnt=0;

for(int p=0;p<leng1-1;p++)

{

int minimum = p;

for(int i=p+1;i<leng1;i++)

{

if(weight_1[i]<weight_1[minimum])

{

minimum = i;

}

}

int tempvalue=weight_1[p];

weight_1[p]=weight_1[minimum];

weight_1[minimum]=tempvalue;

  

string tempvalue1=name1[p];

name1[p]=name1[minimum];

name1[minimum]=tempvalue1;

}

cout<<"\n\n--SELECTION SORT ASCENDING ORDER ";

for(int i=0;i<leng1;i++)

{

cout<<setw(10)<<"\nName :"<<name1[i]<<" weight : "<<weight_1[i];

}

cout<<"\n\n-OUTPUT FOR ASCENDING ORDER ";

for(int j=0;j<leng1;j++)

{

if((tempvalue_total+weight_1[j])<=liftlimit)

{

tempvalue_total=tempvalue_total+weight_1[j];

cout<<setw(10)<<"\nName :"<<name1[j]<<" weight : "<<weight_1[j];

cnt++;

}

}

cout<<"\n--->Total weight :"<<tempvalue_total<<" Person cnt : "<<cnt;

return cnt;

}

int descendinglist_elevator(string name1[],int weight_1[],int leng1)

{

int liftlimit=1100,tempvalue_total=0,cnt=0;

for(int p=0;p<leng1-1;p++)

{

for(int i=0;i<leng1-1;i++)

{

if(weight_1[i]<weight_1[i+1])

{

int tempvalue=weight_1[i];

weight_1[i]=weight_1[i+1];

weight_1[i+1]=tempvalue;

  

string tempvalue1=name1[i];

name1[i]=name1[i+1];

name1[i+1]=tempvalue1;

}

}

}

cout<<"\n\nBUBBLE SORT DESCENDING ORDER";

for(int i=0;i<leng1;i++)

{

cout<<setw(10)<<"\nName :"<<name1[i]<<" weight : "<<weight_1[i];

}

cout<<"\n\nOUTPUT FOR DESCENDING ORDER INPUT-";

for(int j=0;j<leng1;j++)

{

if((tempvalue_total+weight_1[j])<=liftlimit)

{

tempvalue_total=tempvalue_total+weight_1[j];

cout<<setw(10)<<"\nName :"<<name1[j]<<" weight : "<<weight_1[j];

cnt++;

}

}

cout<<"\n--->Total weight :"<<tempvalue_total<<" Person cnt : "<<cnt;

return cnt;

}

int list_elevator(string name1[],int weight_1[],int leng1)

{

int liftlimit=1100,tempvalue_total=0,cnt=0;

cout<<"\n\n-OUTPUT FOR DIRECT GIVEN INPUT-";

for(int i=0;i<leng1;i++)

{

if((tempvalue_total+weight_1[i])<=liftlimit)

{

tempvalue_total=tempvalue_total+weight_1[i];

cout<<setw(10)<<"\nName :"<<name1[i]<<" weight : "<<weight_1[i];

cnt++;

}

}

cout<<"\n--->Total weight :"<<tempvalue_total<<" Person cnt : "<<cnt;

return cnt;

}

int main()

{

string name[]={"Anne","Bob","Ralph","Tim","Barbara","Jane","Steve","Tom","Mike","Shirley","Pam","Frank"};

int weight[] ={150,250,305,250,85,160,180,210,165,155,125,130};

int cnt1,cnt2,cnt3,len;

len=(sizeof(weight)/sizeof(int));

for(int i=0;i<len;i++)

{

cout<<setw(10)<<"\nName :"<<name[i]<<" weight : "<<weight[i];

}

cnt1=list_elevator(name,weight,len);

cnt2=descendinglist_elevator(name,weight,len);

cnt3=ascendinglist_elevator(name,weight,len);

if(cnt1>cnt2&&cnt1>cnt3)

{

cout<<"\n\nDirect Input method is BEST "<<cnt1;

}

else if(cnt2>cnt1&&cnt2>cnt3)

{

cout<<"\n\nDescending Order Input method is BEST : "<<cnt2;

}

else if(cnt3>cnt1&&cnt3>cnt2)

{

cout<<"\n\nAscending Order Input method is BEST with cnt of Person : "<<cnt3;

}

return 0;

}