Solved

Sorting algorithm (Easy but long)

Posted on 2001-06-03
14
222 Views
Last Modified: 2008-03-03
// I have this class:

class Person
{
protected:
     char *first;
     char *last;
     char *address;
     char *city;
     char *state;
     long int zip;
     long int phone;

public:
     Person();
     Person(char *First,char *Last,char *Address,char *City,char *State, long int zip, long int phone);      
     

// I have array of Person objects that need to be sorted by last,first name.  Assume the array has 50 or less items and should be sorted using a simple Quick sort or Merge sort whichever is more efficient."NO BUBBLE SORT I can do that".  For an A grade I need code that will work and an explanation of how it works.  Please make the code as simple as possible.
0
Comment
Question by:DwarfBaby
  • 7
  • 4
  • 2
  • +1
14 Comments
 
LVL 5

Accepted Solution

by:
djbusychild earned 200 total points
Comment Utility
you could use qsort or use STL's template classes' own sort functions.. to use qsort do something like this..
pretty self-explanatory... I think.. It's for example purposes only.

#include <stdlib.h>
#include <string.h>
#include <iostream.h>

class Person
{
protected:
    char *first;
    char *last;
    char *address;
    char *city;
    char *state;
    long int zip;
    long int phone;

public:
    Person(){first=last=address=city=state=NULL;zip=0;phone=0;}
    void setMembers(char *First,char *Last)
     {
          /* not checking arr bonds */
          first=new char[strlen(First)];
          last=new char[strlen(Last)];
          strcpy(first,First);
          strcpy(last,Last);
     }
     char* getLastName(){return last;};
     char* getFirstName(){return first;};
};

/*
   <0 elem1<elem2
    0 elem1==elem2
   >0 elem1>elem2
*/
int compareByLastName(const void *elem1, const void *elem2)
{
     Person* person1=(Person*)elem1;
     Person* person2=(Person*)elem2;

     return strcmp(person1->getLastName(),person2->getLastName());
}
int compareByFirstName(const void *elem1, const void *elem2)
{
     Person* person1=(Person*)elem1;
     Person* person2=(Person*)elem2;

     return strcmp(person1->getFirstName(),person2->getFirstName());
}
int main(int argc, char* argv[]) {

     Person people[5];
     people[0].setMembers("a","e");
     people[1].setMembers("b","d");
     people[2].setMembers("c","c");
     people[3].setMembers("d","b");
     people[4].setMembers("e","a");

     cout << endl<< "sort by last name"<<endl;

     qsort(people,5,sizeof(Person),compareByLastName);

     int i;
     for (i=0;i<5;i++) {
          cout << "Last Name:" << people[i].getLastName() << " Firt Name:"<<people[i].getFirstName()<<endl;
     }
     cout << endl<<"sort by first name"<<endl;

     qsort(people,5,sizeof(Person),compareByFirstName);
     for (i=0;i<5;i++) {
          cout << "Last Name:" << people[i].getLastName() << " Firt Name:"<<people[i].getFirstName()<<endl;
     }
     return 0;
}
0
 
LVL 5

Expert Comment

by:djbusychild
Comment Utility
you should do your own tidying it up, encapsulating, err checking, etc, etc... this is purely a quick hack example. =)
0
 
LVL 5

Expert Comment

by:djbusychild
Comment Utility
qsort is a builtin function in stdlib that does qsort for you.

the man page entry can be found here

http://www.opengroup.org/onlinepubs/007908799/xsh/qsort.html

you're basically telling it how big the data is, how many of them there are, and what function shold be used to compare the two.
0
 
LVL 5

Expert Comment

by:djbusychild
Comment Utility
I really should be allocating memory for strlen(last)+1 there.. (for the NULL terminating char), and if you're a C++ person you wouldn't use the C style casting that I used either.
0
 

Author Comment

by:DwarfBaby
Comment Utility
Ok, I understand your code but I'm trying to learn how the quick sort works.  I need the code for a quick sort not the code for how to use the quick sort.  Sorry, I was not very clear about what I wanted.
0
 
LVL 5

Expert Comment

by:djbusychild
Comment Utility
oh, well here's an example with full explanation (There are gazilliong qsort implementations on the web)

http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/qsort1a.html
0
 
LVL 5

Expert Comment

by:djbusychild
Comment Utility
if you don't understand the explanation I can help you
0
Maximize Your Threat Intelligence Reporting

Reporting is one of the most important and least talked about aspects of a world-class threat intelligence program. Here’s how to do it right.

 

Author Comment

by:DwarfBaby
Comment Utility
I need to get something to eat and then I am going to try to work a quick sort into my code.  I will let you know if I need more explanation in a couple hours.  Thanks
0
 

Expert Comment

by:idyott
Comment Utility
this question sounds like homework
0
 
LVL 5

Expert Comment

by:djbusychild
Comment Utility
hmm... come to think of it, it does. idyott... ;)
0
 

Author Comment

by:DwarfBaby
Comment Utility
Thanks for the help.
0
 
LVL 22

Expert Comment

by:nietod
Comment Utility
DwarfBaby, if this is homework then the solution above will not be satisfactory.  You would be expected to write your own sort procedure, not use one that is part of the standard library.  (Is like ordering take-out food for a cooking class in home-ec.)

And if that is the case, then we can't _give_ you the answer.  You need to write it yourself.  But we coudl help you.
0
 

Author Comment

by:DwarfBaby
Comment Utility
The question was not really homework.  I say not really because all the instructions called for either Selection sort or an insertion sort, which I know how to do.  I just thought I'd throw in a quicksort too for some browny points.  Although I did finally get the quick sort to work I barley understand how it works.  If anyone knows of a good website that can explain it better I will set up some extra points for you.  Thanks
0
 

Expert Comment

by:idyott
Comment Utility
you can use "the c programming language"
in the index look 4 qosrt and u will c how it is written.

very generally, it uses divides the array in2 2 parts and sorts each of them recursively
0

Featured Post

How your wiki can always stay up-to-date

Quip doubles as a “living” wiki and a project management tool that evolves with your organization. As you finish projects in Quip, the work remains, easily accessible to all team members, new and old.
- Increase transparency
- Onboard new hires faster
- Access from mobile/offline

Join & Write a Comment

Often, when implementing a feature, you won't know how certain events should be handled at the point where they occur and you'd rather defer to the user of your function or class. For example, a XML parser will extract a tag from the source code, wh…
Container Orchestration platforms empower organizations to scale their apps at an exceptional rate. This is the reason numerous innovation-driven companies are moving apps to an appropriated datacenter wide platform that empowers them to scale at a …
The viewer will learn additional member functions of the vector class. Specifically, the capacity and swap member functions will be introduced.
The viewer will learn how to clear a vector as well as how to detect empty vectors in C++.

763 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

16 Experts available now in Live!

Get 1:1 Help Now