sort a structure

I am trying to sort the Structure by author and title
when i try to sort it by author it will only let me sort
the author and not the title with it.
so, when i sort by author the title is wrong.
heres what i have:

Code:

struct Library {

string Title;
string Author;
};

const int ARRAY_SIZE = 1000;
Library books [ ARRAY_SIZE ];

Code:

void SortByAuthor( int count )
{

string temp;
   for ( int index = 1; index < count; index++ )
     {
       for( int i = 0; i < count; i++ )
       if(books[i].Author > books[index].Author)
       {
       temp = books[i].Author;
       books[i].Author = books[index].Author;
       books[index].Author = temp;

}
      
}

now I would imagine
I would want to do this:

Code:

if(books[i].Author > books[index].Author)
{
temp = books[i];
books[i] = books[index];
books[index] = temp;
}

to copy the whole struct but, i get errors.

Code:

1>error C2679: binary '=' : no operator found which takes a right-hand operand of type 'Library' (or there is no acceptable conversion)

whats wrong?
thanks in advance.

Are you allowed to use std::sort()?

Originally Posted by mrsirpoopsalot

whats wrong?

You are trying to assign a Library object to a std::string object.

I am allowed to use std::sort()
what can i assign temp to?
books temp dont work.

I will google sort();
not sure how it works in my case..

Originally Posted by mrsirpoopsalot

I am allowed to use std::sort()

Good. Use the version of std::sort() that takes a predicate in addition to the two iterators. You can then implement two predicates: one to compare Library objects by Title, the other to compare Library objects by Author (and come to think of it, perhaps you should rename Library to Book or Publication). These predicates can come in the form of functions that have two Library (const reference) parameters and return a bool, or function objects that overload operator() to have two Library (const reference) parameters and return a bool.

it looks like std::sort() works with vector.
we have not learned that yet.
I dont mind sticking with buble sort.

It works with arrays as well.

i am not really finding anything that helps.

laserlight has givn you an answer in the 4th post of this thread. You'll need to look up the meaning of some of the words in that post, as they are specific to C++ and/or to concepts related to the C++ standard library. However, with a bit of research, you will find that post is spot on.

Since this is obviously a homework or other learning exercise, you need to do some work to learn.

Did you change the declaration of 'temp' to 'Library'?

Also, being pedantic here, but that's not a bubble sort. Bubble sort only swaps adjacent items.
I call that one Simple sort.

You use std::sort on an array like this, if you have defined an appropriate less-than operator:

Code:

std::sort(books, books+count);

Originally Posted by iMalc

You use std::sort on an array like this, if you have defined an appropriate less-than operator:

However, as I suggested earlier, you should be defining predicates other than a less than operator since you want to sort based on title and author separately. It may not make sense to have a default comparison, but if it does, then defining operator< would be fine.

I did try assigning temp to library
ex: library temp; but VS complained.
what i did eventually get to work using the algorithm header

Code:

void SortByTitle( int count )
{

 int CurrIndex, index;
 int smallestindex;

   for( int index = 0; index < count; index++ )
      {
      smallestindex = index;
      for( CurrIndex = index + 1; CurrIndex < count; CurrIndex++)
      {
      if(books[CurrIndex].Title < books[smallestindex].Title)
      smallestindex = CurrIndex;
      swap(books[index], books[smallestindex]);
}
}
}

laserlight thank you for all your help! I think your suggestion was a little over my head.
I did take what you said into consideration.. Thank you