[unknownGuy]

I was wondering how I could possibly put the vector "guy" in order by "done()". Here is what I have so far:

double done;
vector<people> guy;
vector<people> newGuy;
for ( int i = 0; i < id; i++ )
{
    done = guy[i].done();
    int smallest = i;
    for( int j = i + 1; j < id; j++ ){
        if( done > guy[j].done() )
            {
                done = guy[j].done();
                smallest = j;   
            }
        }
    newGuy.push_back( guy[smallest] );
}

This doesn't organize every part of the vector, and sometimes even copies the same guy into the newGuy. Any ideas?

[jimblumberg]

If you can't use std::sort I suggest you research sorting. You are not even close to having a proper sort routine in the code you posted.

Jim

[TwoOfDiamonds]

As jimblumberg mentioned , why don't you use std::sort , and as a general hint . Try to learn more about STL (standard template library), especially algorithms , maps and vectors .

Here you got STL Containers and STL algorithms.

Off Topic :

By the way , jim, congrats for your most recent award .

[baavgai]

Well, it looks like a basic selection sort, except you've missed the money shot. Sort do this sort, once you've found the smallest value, you change the list of values you're working in. You don't do that, you push the value into another list, but you really don't affect the list you started with.

You could make an array of indexes, sort that, and then use that to generate a new list.

You could do a simple insertion sort. Here, insertion is trivial, because vector has an insert function.

Or, just use sort.