Sort an array of items by given key

Return a copy sorted by one field, ascending.

JavaScript Version 1.0.0 · MIT · .md

function sortBy({ values, key }) { return [...values].sort((a, b) => (a[key] > b[key] ? 1 : a[key] < b[key] ? -1 : 0)); }

Input & expected output

{
  "values": [
    {
      "status": "deferred"
    },
    {
      "status": "bounced"
    },
    {
      "status": "delivered"
    }
  ],
  "key": "status"
}

[
  {
    "status": "bounced"
  },
  {
    "status": "deferred"
  },
  {
    "status": "delivered"
  }
]

The edge case

{
  "values": [],
  "key": "status"
}

[]

Know the limits

• Mixed types compare unpredictably; keep the field one type.
• Sorting is stable, so equal keys keep their order.

The function above is the implementation used by the lab. The lab validates JSON types and caps size before execution; include equivalent validation when accepting untrusted input in your application.

Keep exploring

• Clone an array — Create a new array without copying the objects inside it.
• Remove duplicate values — Keep the first occurrence of each value, in its original order.
• Flatten a nested array — Turn a nested array into one sequence of values.