You can use Collections.sort
with a custom Comparator<HockeyPlayer>
.
class HockeyPlayer {
public final int goalsScored;
// ...
};
List<HockeyPlayer> players = // ...
Collections.sort(players, new Comparator<HockeyPlayer>() {
@Override public int compare(HockeyPlayer p1, HockeyPlayer p2) {
return p1.goalsScored - p2.goalsScored; // Ascending
}
});
The comparision part can also be written this way :
players.sort(Comparator.comparingInt(HockeyPLayer::goalsScored));
Alternatively, you can make HockeyPlayer implements
Comparable<HockeyPlayer>
. This defines the natural ordering for all HockeyPlayer
objects. Using a Comparator
is more flexible in that different implementations can order by name, age, etc.
See also
For completeness, I should caution that the return o1.f - o2.f
comparison-by-subtraction shortcut must be used with extreme caution due to possible overflows (read: Effective Java 2nd Edition: Item 12: Consider implementing Comparable
). Presumably hockey isn’t a sport where a player can score goals in the amount that would cause problems =)