stable_sort with arrays?

[Andreas Schmitt]

Is it possible to do something like this:

Team* League[4];

for (int team=0; team<4; team++)

{

League[team] = new Team;

}

std::stable_sort(League[0], League[3], TeamIsBetter );

***********************************

bool TeamIsBetter( Team* Team1, Team* Team2 )

{

int PointsTeam1 = Team1->GetPoints();

int PointsTeam2 = Team2->GetPoints();
return PointsTeam2 > PointsTeam1;

}

[Kai-Uwe Bux]

Andreas Schmitt wrote:

Is it possible to do something like this:

Team* League[4];

for (int team=0; team<4; team++)

{

League[team] = new Team;

}

std::stable_sort(League[0], League[3], TeamIsBetter );
Use:

std::stable_sort(League+0, League+4, TeamIsBetter );

a) Pointers into an array can be used as iterators in generic algorithms
from the standard library.

b) std::stable_sort wants the second parameter to point *past* the end.

***********************************

bool TeamIsBetter( Team* Team1, Team* Team2 )

{

int PointsTeam1 = Team1->GetPoints();

int PointsTeam2 = Team2->GetPoints();
return PointsTeam2 > PointsTeam1;

}

Best

Kai-Uwe Bux