I have an array of objects that represent hockey rank data:
[
{
name: "Russia",
points: 10,
iihf: 1
},
{
name: "USA",
points: 10,
iihf: 7
},
{
name: "Slovakia",
points: 8,
iihf: 6
}
]
I want to sort the data descending from the highest score. If two or more teams share the same point count, they have to be fine sorted using next dimensions, namely the IIHF rank (ascending order). Is there an elegant solution to this?
Thanks.
As addition: if you know an upper limit of the iihf score, you can also precompute a compound score, that you only use for sorting. The compound score could look like this:
obj.cscore = obj.points * 10000 + obj.iihf;
After that, you can just sort after the cscore:
arr.sort(function(a,b) {
return a.cscore - b.cscore;
});
If you don't want to pollute your original objects, you can use a temporary map (as described here):
var map = arr.map(function (e, i) {
return {index: i, cscore: e.points * 1000 + e.iihf};
});
map.sort(function (a,b) {
return a.cscore - b.cscore;
});
var result = map.map(function(e){
return arr[e.index]
});
return a.cscore < b.cscore ? 1 : -1 is not correct - you're missing the equal case. An elegant way to compare numbers is to return their difference: return a.score - b.score.
return b.points - a.points || a.iihf - b.iihf - no need for a compound key.Use Array.sort(), if the values of points are equal, sort on iihf instead
arr.sort(function(a,b) {
if (a.points == b.points) return a.iihf > b.iihf ? 1 : -1;
return a.points < b.points ? 1 : -1;
});
Try this
function comparator(a, b) {
if (a.points == b.points) return a.iihf > b.iihf ? 1 : -1;
return a.points < b.points ? 1 : -1;
}
var json = { "homes":
[
{
name: "Russia",
points: 10,
iihf: 1
},
{
name: "USA",
points: 10,
iihf: 7
},
{
name: "Slovakia",
points: 8,
iihf: 6
}
]};
console.log(json["homes"].sort(comparator));