Sort array of objects by string property value

Question

I have an array of JavaScript objects   var objs            first nom   Lazslo   last nom   Jamf               first nom   Pig      last nom   Bodine             first nom   Pirate   last nom   Prentice         How can I sort them by the value of last nom in JavaScript   I know about sort a b   but that only seems to work on strings and numbers  Do I need to add a toString   method to my objects

User · Answer

A simple function that sort an array of object by a property

function sortArray(array, property, direction) {
    direction = direction || 1;
    array.sort(function compare(a, b) {
        let comparison = 0;
        if (a[property] > b[property]) {
            comparison = 1 * direction;
        } else if (a[property] < b[property]) {
            comparison = -1 * direction;
        }
        return comparison;
    });
    return array; // Chainable
}

Usage:

var objs = [ 
    { first_nom: 'Lazslo', last_nom: 'Jamf'     },
    { first_nom: 'Pig',    last_nom: 'Bodine'   },
    { first_nom: 'Pirate', last_nom: 'Prentice' }
];

sortArray(objs, "last_nom"); // Asc
sortArray(objs, "last_nom", -1); // Desc

User · Answer

Using Ramda   npm install ramda  import R from  ramda  var objs            first nom   Lazslo   last nom   Jamf               first nom   Pig      last nom   Bodine             first nom   Pirate   last nom   Prentice       var ascendingSortedObjs   R sortBy R prop  last nom    objs  var descendingSortedObjs   R reverse ascendingSortedObjs

User · Answer

Simple answer  objs sort  a b   gt a last nom localeCompare b last nom    Details  Today it is very simple  You can compare strings with localeCompare  As the Mozilla Doc says   The localeCompare   method returns a number indicating whether a reference string comes before  or after  or is the same as the given string in sort order         example1      console log  quot aaa quot  localeCompare  quot aab quot       -1     console log  quot aaa quot  localeCompare  quot aaa quot       0     console log  quot aab quot  localeCompare  quot aaa quot       1         example2      const a    r  serv        with accents  lowercase     const b    RESERVE      no accents  uppercase      console log a localeCompare b           expected output  1     console log a localeCompare b   en     sensitivity   base              expected output  0  For more details see Mozilla doclocaleCompare

User · Answer

Old answer that is not correct   arr sort  a  b    gt  a name  gt  b name    UPDATE  From Beauchamp s comment   arr sort  a  b    gt  a name  lt  b name   -1    a name  gt  b name   1   0     More readable format   arr sort  a  b    gt      if  a name  lt  b name  return -1   return a name  gt  b name   1   0      Without nested ternaries   arr sort  a  b    gt  a name  lt  b name   - 1   Number a name  gt  b name     Explanation  Number   will cast true to 1 and false to 0

User · Answer

If you have duplicate last names you might sort those by first name-  obj sort function a b     if a last nom lt  b last nom  return -1    if a last nom  gt b last nom  return 1    if a first nom lt  b first nom  return -1    if a first nom  gt b first nom  return 1    return 0

User · Answer

sort method can be modified to sort anything like an array of numbers  strings and even objects using compare function  Compare function is passed as an optional argument to the sort method  Compare function accepts 2 arguments generally called a and b  Based on these 2 arguments you can modify the sort method to work as you want  if   If compare function returns less than 0  then the sort   method sorts a at a lower index than b  Simply a will come before b  If compare function returns equal to 0  then sort   method leave the element positions as it is  If compare function returns greater than 0  then sort   method sorts a at greater index than b  Simply a will come after b   Reference  Understanding sorting array of numbers  strings and objects Use the above concept to apply on your object where a will be your object property   x000D   x000D  var objs         first nom   Lazslo   last nom   Jamf         first nom   Pig   last nom   Bodine         first nom   Pirate   last nom   Prentice       function compare a  b      if  a last nom  gt  b last nom  return 1    if  a last nom  gt  b last nom  return -1    return 0    objs sort compare   console log objs     for better look use console table objs  x000D   x000D   x000D

User · Answer

You can also create a dynamic sort function that sorts objects by their value that you pass  function dynamicSort property        var sortOrder   1      if property 0       quot - quot             sortOrder   -1          property   property substr 1             return function  a b               next line works with strings and numbers              and you may want to customize it to your needs                     var result    a property   lt  b property     -1    a property   gt  b property     1   0          return result   sortOrder           So you can have an array of objects like this  var People          Name   quot Name quot   Surname   quot Surname quot         Name  quot AAA quot   Surname  quot ZZZ quot         Name   quot Name quot   Surname   quot AAA quot          and it will work when you do  People sort dynamicSort  quot Name quot     People sort dynamicSort  quot Surname quot     People sort dynamicSort  quot -Surname quot      Actually this already answers the question  Below part is written because many people contacted me  complaining that it doesn t work with multiple parameters  Multiple Parameters You can use the function below to generate sort functions with multiple sort parameters  function dynamicSortMultiple                   save the arguments object as it will be overwritten        note that arguments object is an array-like object        consisting of the names of the properties to sort by             var props   arguments      return function  obj1  obj2            var i   0  result   0  numberOfProperties   props length             try getting a different result from 0  equal             as long as we have extra properties to compare                     while result     0  amp  amp  i  lt  numberOfProperties                result   dynamicSort props i   obj1  obj2               i                      return result           Which would enable you to do something like this  People sort dynamicSortMultiple  quot Name quot    quot -Surname quot      Subclassing Array For the lucky among us who can use ES6  which allows extending the native objects  class MyArray extends Array       sortBy    args            return this sort dynamicSortMultiple    args             That would enable this  MyArray from People  sortBy  quot Name quot    quot -Surname quot

User · Answer

This will sort a two level nested array by the property passed to it in alpha numeric order   function sortArrayObjectsByPropAlphaNum property        return function  a b            var reA      a-zA-Z  g          var reN      0-9  g          var aA   a property  replace reA               var bA   b property  replace reA                if aA     bA                var aN   parseInt a property  replace reN       10               var bN   parseInt b property  replace reN       10               return aN     bN   0   aN  gt  bN   1   -1            else               return a property   gt  b property    1   -1                       Usage   objs sort utils sortArrayObjectsByPropAlphaNum  last nom

User · Answer

This is my take on this  The order parameter is optional and defaults to  quot ASC quot  for ascending order  Works on accented chars and it s case insensitive  NOTE  It sorts and returns the ORIGINAL array  function sanitizeToSort str      return str      normalize  NFD                        REMOVE ACCENTED AND DIACRITICS      replace    u0300- u036f  g            REMOVE ACCENTED AND DIACRITICS      toLowerCase                           SORT WILL BE CASE INSENSITIVE        function sortByProperty arr  property  order  quot ASC quot       arr forEach  item    gt  item tempProp   sanitizeToSort item property       arr sort  a b    gt  order      quot ASC quot          a tempProp  gt  b tempProp    1   a tempProp  lt  b tempProp   -1   0       a tempProp  gt  b tempProp   -1   a tempProp  lt  b tempProp    1   0        arr forEach  item    gt  delete item tempProp     return arr     SNIPPET  x000D   x000D  function sanitizeToSort str      return str      normalize  NFD                        REMOVE ACCENTED CHARS      replace    u0300- u036f  g            REMOVE DIACRITICS      toLowerCase          function sortByProperty arr  property  order  ASC       arr forEach  item    gt  item tempProp   sanitizeToSort item property       arr sort  a b    gt  order      ASC          a tempProp  gt  b tempProp    1   a tempProp  lt  b tempProp   -1   0       a tempProp  gt  b tempProp   -1   a tempProp  lt  b tempProp    1   0        arr forEach  item    gt  delete item tempProp     return arr     const rockStars         name   Axl       lastname   Rose         name   Elthon       lastname   John         name   Paul       lastname   McCartney         name   Lou       lastname   Reed         name   freddie                  WORKS ON LOWER UPPER CASE     lastname   mercury         name     my                      WORKS ON ACCENTED CHARS TOO     lastname   winehouse          sortByProperty rockStars  name     console log  Ordered by name A-Z     rockStars forEach  item    gt  console log item name         item lastname     sortByProperty rockStars  lastname   DESC     console log   nOrdered by lastname Z-A     rockStars forEach  item    gt  console log item lastname          item name    x000D   x000D   x000D

User · Answer

Combining Ege s dynamic solution with Vinay s idea  you get a nice robust solution   Array prototype sortBy   function         function  sortByAttr attr            var sortOrder   1          if  attr 0      -                 sortOrder   -1              attr   attr substr 1                     return function a  b                var result    a attr   lt  b attr     -1    a attr   gt  b attr     1   0              return result   sortOrder                      function  getSortFunc             if  arguments length    0                throw  Zero length arguments not allowed for Array sortBy                       var args   arguments          return function a  b                for  var result   0  i   0  result    0  amp  amp  i  lt  args length  i                      result    sortByAttr args i   a  b                             return result                      return this sort  getSortFunc apply null  arguments        Usage      Utility for printing objects Array prototype print   function title        console log                                                                                  console log         title       console log                                                                                  for  var i   0  i  lt  this length  i              console log  Name    this i  FirstName  this i  LastName   Age    this i  Age               Setup sample data var arrObj          FirstName   Zach   LastName   Emergency   Age  35        FirstName   Nancy   LastName   Nurse   Age  27        FirstName   Ethel   LastName   Emergency   Age  42        FirstName   Nina   LastName   Nurse   Age  48        FirstName   Anthony   LastName   Emergency   Age  44        FirstName   Nina   LastName   Nurse   Age  32        FirstName   Ed   LastName   Emergency   Age  28        FirstName   Peter   LastName   Physician   Age  58        FirstName   Al   LastName   Emergency   Age  51        FirstName   Ruth   LastName   Registration   Age  62        FirstName   Ed   LastName   Emergency   Age  38        FirstName   Tammy   LastName   Triage   Age  29        FirstName   Alan   LastName   Emergency   Age  60        FirstName   Nina   LastName   Nurse   Age  54        Unit Tests arrObj sortBy  LastName   print  LastName Ascending    arrObj sortBy  -LastName   print  LastName Descending    arrObj sortBy  LastName    FirstName    -Age   print  LastName Ascending  FirstName Ascending  Age Descending    arrObj sortBy  -FirstName    Age   print  FirstName Descending  Age Ascending    arrObj sortBy  -Age   print  Age Descending

User · Answer

function compare propName        return function a b            if  a propName   lt  b propName               return -1          if  a propName   gt  b propName               return 1          return 0            objs sort compare  last nom

User · Answer

I Just enhanced Ege   zcan s dynamic sort to dive deep inside objects   If Data looks like this    obj                   a    a  1  b  2  c  3            b    a  4  b  5  c  6                         a    a  3  b  2  c  1            b    a  6  b  5  c  4         and if you want to sort it over a a property I think my enhancement helps very well  I add new functionality to objects like this   Object defineProperty Object prototype   deepVal         enumerable  false      writable  true      value  function  propertyChain            var levels   propertyChain split               parent   this          for  var i   0  i  lt  levels length  i                  if   parent levels i                    return undefined              parent   parent levels i                      return parent              and changed  dynamicSort s return function   return function  a b            var result     a deepVal property   gt  b deepVal property   -  a deepVal property   lt  b deepVal property             return result   sortOrder          And now you can sort by a a  this way   obj sortBy  a a      See Commplete script in JSFiddle

User · Answer

In case you have nested objects  const objs              first nom   Lazslo           last nom   Jamf           moreDetails                age  20                            first nom   Pig           last nom   Bodine           moreDetails                age  21                            first nom   Pirate           last nom   Prentice           moreDetails                age  22                    nestedSort    prop1  prop2   null  direction    asc     gt   e1  e2    gt            const a   prop2   e1 prop1  prop2    e1 prop1               b   prop2   e2 prop1  prop2    e2 prop1               sortOrder   direction      asc    1   -1         return  a  lt  b    -sortOrder    a  gt  b    sortOrder   0          and call it like  objs sort nestedSort  last nom     objs sort nestedSort  last nom   null   desc     objs sort nestedSort  moreDetails    age     objs sort nestedSort  moreDetails    age    desc

User · Answer

You may need to convert them to the lower case in order to prevent from confusion   objs sort function  a b     var nameA a last nom toLowerCase    nameB b last nom toLowerCase    if  nameA  lt  nameB    return -1  if  nameA  gt  nameB    return 1  return 0     no sorting

User · Answer

additional desc params for Ege   zcan code  function dynamicSort property  desc        if  desc            return function  a  b                return  a property   gt  b property     -1    a property   lt  b property     1   0                         return function  a  b            return  a property   lt  b property     -1    a property   gt  b property     1   0

User · Answer

this sorting funciton can be use for all object sorting     object deepObject numeric array   you can also do assending or desending sort by passing 1 -1 as param   x000D   x000D  Object defineProperty Object prototype   deepVal     x000D      enumerable  false  x000D      writable  true  x000D      value  function  propertyChain    x000D          var levels   propertyChain split       x000D          parent   this  x000D          for  var i   0  i  lt  levels length  i      x000D              if   parent levels i    x000D                  return undefined  x000D              parent   parent levels i    x000D            x000D          return parent  x000D        x000D      x000D   x000D   x000D  function dynamicSortAll property sortOrders 1    x000D   x000D     default sorting will be ascending order if you need descending order x000D  sording you have to pass -1 as param    x000D   x000D      var sortOrder   sortOrders  x000D      x000D      return function  a b    x000D   x000D     var result   property    a deepVal property   gt  b deepVal property     1    a deepVal property   lt  b deepVal property     -1   0     a  gt  b    1    a  lt  b    -1   0   x000D     x000D          return result   sortOrder  x000D     x000D      x000D        x000D    x000D   x000D  deepObj     x000D        x000D          a    a  1  b  2  c  3    x000D          b    a  4  b  5  c  6   x000D         x000D         x000D          a    a  3  b  2  c  1    x000D          b    a  6  b  5  c  4   x000D      x000D   x000D  let deepobjResult deepObj sort dynamicSortAll  a a  1   x000D  console log  deepobjResult     JSON stringify deepobjResult   x000D  var obj      x000D        first nom   Lazslo   last nom   Jamf         x000D        first nom   Pig      last nom   Bodine       x000D        first nom   Pirate   last nom   Prentice    x000D     x000D  let objResult obj sort dynamicSortAll  last nom  1   x000D  console log  objResult     JSON stringify objResult   x000D   x000D  var numericObj  1 2 3 4 5 6  x000D   x000D  let numResult numericObj sort dynamicSortAll null -1   x000D  console log  numResult     JSON stringify numResult   x000D   x000D  let stringSortResult  helloworld  split     sort dynamicSortAll null 1   x000D   x000D   console log  stringSortResult    JSON stringify stringSortResult   x000D   x000D  let uniqueStringOrger     new Set stringSortResult     x000D   console log  uniqueStringOrger    JSON stringify uniqueStringOrger   x000D   x000D   x000D

User · Answer

As of 2018 there is a much shorter and elegant solution  Just use  Array prototype sort     Example   var items         name   Edward   value  21        name   Sharpe   value  37        name   And   value  45        name   The   value  -12        name   Magnetic   value  13        name   Zeros   value  37          sort by value items sort function  a  b      return a value - b value

User · Answer

There are many good answers here  but I would like to point out that they can be extended very simply to achieve a lot more complex sorting  The only thing you have to do is to use the OR operator to chain comparision functions like this   objs sort  a b   gt  fn1 a b     fn2 a b     fn3 a b      Where fn1  fn2      are the sort functions which return  -1 0 1   This results in  sorting by fn1    sorting by fn2  which is pretty much equal to ORDER BY in SQL   This solution is based on the behaviour of    operator which evaluates to the first evaluated expression which can be converted to true   The simplest form has only one inlined function like this      ORDER BY last nom objs sort  a b   gt  a last nom localeCompare b last nom      Having two steps with  last nom first nom sort order would look like this      ORDER BY last nom  first nom objs sort  a b   gt  a last nom localeCompare b last nom                        a first nom localeCompare b first nom        A generic comparision function could be something like this      ORDER BY  lt n gt  let cmp    a b n   gt a n  localeCompare b n     This function could be extended to support numeric fields  case sensitity  arbitary datatypes etc   You can them use it with chaining them by sort priority      ORDER BY last nom  first nom objs sort  a b   gt  cmp a b   last nom      cmp a b   first nom        ORDER BY last nom  first nom DESC objs sort  a b   gt  cmp a b   last nom      -cmp a b   first nom        ORDER BY last nom DESC  first nom DESC objs sort  a b   gt  -cmp a b   last nom      -cmp a b   first nom       The point here is that pure JavaScript with functional approach can take you a long way without external libraries or complex code  It is also very effective  since no string parsing have to be done

User · Answer

I know this question is too old  but I didn t see any implementation similar to mine  This version is based on the Schwartzian transform idiom    function sortByAttribute array     attrs         generate an array of predicate-objects contains      property getter  and descending indicator   let predicates   attrs map pred   gt        let descending   pred charAt 0       -    -1   1      pred   pred replace   -            return         getter  o   gt  o pred         descend  descending                   schwartzian transform idiom implementation  aka   decorate-sort-undecorate    return array map item   gt        return         src  item        compareValues  predicates map predicate   gt  predicate getter item                  sort  o1  o2    gt        let i   -1  result   0      while    i  lt  predicates length          if  o1 compareValues i   lt  o2 compareValues i   result   -1        if  o1 compareValues i   gt  o2 compareValues i   result   1        if  result    predicates i  descend  break            return result          map item   gt  item src       Here s an example how to use it   let games         name   Mashraki            rating  4 21        name   Hill Climb Racing   rating  3 88        name   Angry Birds Space   rating  3 88        name   Badland             rating  4 33          sort by one attribute console log sortByAttribute games   name        sort by mupltiple attributes console log sortByAttribute games   -rating    name

User · Answer

Lodash js  superset of Underscore js   It s good not to add a framework for every simple piece of logic  but relying on well tested utility frameworks can speed up development and reduce the amount of bugs   Lodash produces very clean code and promotes a more functional programming style  In one glimpse it becomes clear what the intent of the code is   OP s issue can simply be solved as   const sortedObjs     sortBy objs   last nom      More info  E g  we have following nested object   const  users               user      name   fred    age    48            user      name   barney     age    36              user      name   wilma             user      name   betty    age    32        We now can use the   property shorthand user age to specify the path to the property that should be matched  We will sort the user objects by the nested age property  Yes  it allows for nested property matching   const sortedObjs     sortBy users     user age       Want it reversed  No problem  Use   reverse   const sortedObjs     reverse   sortBy users     user age        Want to combine both using chain   const   chain     require  lodash    const sortedObjs   chain users  sortBy  user age   reverse   value      Or when do you prefer flow over chain  const   flow  reverse  sortBy     require  lodash fp    const sortedObjs   flow  sortBy  user age    reverse   users

User · Answer

This is a simple problem  don t know why people have such complex solution  A simple sort function  based on quick-sort algorithm    function sortObjectsArray objectsArray  sortKey                           Quick Sort              var retVal               if  1  lt  objectsArray length                                var pivotIndex   Math floor  objectsArray length - 1    2       middle index                 var pivotItem   objectsArray pivotIndex                         value in the middle index                 var less       more                        objectsArray splice pivotIndex  1                               remove the item in the pivot position                 objectsArray forEach function value  index  array                                        value sortKey   lt   pivotItem sortKey                         compare the  sortKey  proiperty                         less push value                            more push value                                         retVal   sortObjectsArray less  sortKey  concat  pivotItem   sortObjectsArray more  sortKey                              else                               retVal   objectsArray                             return retVal              Use example   var myArr                            val   x   idx  3                  val   y   idx  2                  val   z   idx  5               myArr   sortObjectsArray myArr   idx

User · Answer

Sort Array of Objects     Data var booksArray           first nom   Lazslo   last nom   Jamf               first nom   Pig      last nom   Bodine             first nom   Pirate   last nom   Prentice           Property to Sort By var args    last nom       Function to Sort the Data by given Property function sortByProperty property        return function  a  b            var sortStatus   0              aProp   a property  toLowerCase                bProp   b property  toLowerCase            if  aProp  lt  bProp                sortStatus   -1            else if  aProp  gt  bProp                sortStatus   1                    return sortStatus               Implementation var sortedArray   booksArray sort sortByProperty args     console log  sortedArray      JSON stringify sortedArray       Console log output    sortedArray      first nom   Pig   last nom   Bodine      first nom   Lazslo   last nom   Jamf      first nom   Pirate   last nom   Prentice       Adapted based on this source  http   www levihackwith com code-snippet-how-to-sort-an-array-of-json-objects-by-property

User · Answer

One more option   var someArray           function generateSortFn prop  reverse        return function  a  b            if  a prop   lt  b prop   return reverse   1   -1          if  a prop   gt  b prop   return reverse   -1   1          return 0            someArray sort generateSortFn  name   true      sorts ascending by default

User · Answer

Way 1      You can use Underscore js  Import underscore first        import   as   from  underscore    let SortedObjs     sortBy objs   last nom      Way 2    Use compare function       function compare first  second         if  first last nom  lt  second last nom           return -1       if  first last nom  gt  second last nom         return 1      return 0      objs sort compare

User · Answer

You can use a reusable sort function  Array prototype order  function prop  methods           let swipe   1    if  prop  constructor    Object  methods   prop    swipe   methods reverse   -1   1    function key x        if  typeof prop     quot string quot         return methods insensitive   String x prop   toLowerCase     x prop       if  methods insensitive  return String x  toLowerCase        return x        this sort  a  b    gt        if  key a   lt  key b   return -1   swipe      if  key b   lt  key a   return 1   swipe      return 0          return this      Its can be use to sort both Array and Object in array  let arr    6  2  4  1  5  3   let arr2         name   quot Bar quot   age  12        name   quot Nur quot   age  18        name   quot foo quot   age  30        name   quot bazz quot   age  15      arr order   reverse  true           6  5  4  3  2  1   arr2 order  quot name quot     reverse  1  insensitive  0    let arr3       arr2  order  quot age quot        new sorted array created from arr2  But does not change original array   1nd   optional   gt   to sort object contain  in array   2rd is method    gt      reverse  Boolean  insensitive  Boolean

User · Answer

You can use  Easiest Way  Lodash   https   lodash com docs 4 17 10 orderBy   This method is like   sortBy except that it allows specifying the sort orders of the iteratees to sort by  If orders is unspecified  all values are sorted in ascending order  Otherwise  specify an order of  desc  for descending or  asc  for ascending sort order of corresponding values   Arguments  collection  Array Object   The collection to iterate over   iteratees    identity    Array   Function   Object   string     The iteratees to sort by   orders   string     The sort orders of iteratees   Returns   Array   Returns the new sorted array     var     require  lodash    var homes           h id   3         city   Dallas         state   TX         zip   75201         price   162500          h id   4         city   Bevery Hills         state   CA         zip   90210         price   319250          h id   6         city   Dallas         state   TX         zip   75000         price   556699          h id   5         city   New York         state   NY         zip   00010         price   962500             orderBy homes    city    state    zip      asc    desc    asc

User · Answer

A simple way   objs sort function a b      return b last nom toLowerCase    lt  a last nom toLowerCase          See that   toLowerCase    is necessary to prevent erros  in comparing strings

User · Answer

I came into problem of sorting array of objects  with changing priority of values  basically I want to sort array of peoples by their Age  and then by surname - or just by surname  name   I think that this is most simple solution compared to another answers   it  is used by calling sortPeoples   array    of    properties    reverse false    x000D   x000D                         example array of peoples                         x000D   x000D  var peoples     x000D       name   Zach   surname   Emergency   age  1   x000D       name   Nancy   surname   Nurse   age  1   x000D       name   Ethel   surname   Emergency   age  1   x000D       name   Nina   surname   Nurse   age  42   x000D       name   Anthony   surname   Emergency   age  42   x000D       name   Nina   surname   Nurse   age  32   x000D       name   Ed   surname   Emergency   age  28   x000D       name   Peter   surname   Physician   age  58   x000D       name   Al   surname   Emergency   age  58   x000D       name   Ruth   surname   Registration   age  62   x000D       name   Ed   surname   Emergency   age  38   x000D       name   Tammy   surname   Triage   age  29   x000D       name   Alan   surname   Emergency   age  60   x000D       name   Nina   surname   Nurse   age  58  x000D     x000D   x000D   x000D   x000D                           Sorting function                       x000D  function sortPeoples propertyArr  reverse    x000D          function compare a b    x000D              var i 0  x000D              while  propertyArr i     x000D                  if  a propertyArr i    lt  b propertyArr i     return -1  x000D                  if  a propertyArr i    gt  b propertyArr i     return 1  x000D                  i    x000D                x000D              return 0  x000D                x000D          peoples sort compare   x000D          if  reverse   x000D              peoples reverse    x000D            x000D         x000D   x000D                  end of sorting method                x000D  function printPeoples    x000D        output   html      x000D  peoples forEach  function person   x000D       output   append person surname     person name     person age   lt br gt     x000D      x000D    x000D   lt head gt  x000D   lt script src  https   ajax googleapis com ajax libs jquery 2 1 1 jquery min js  gt  lt  script gt  x000D   lt  head gt  x000D     lt html gt  x000D     lt body gt  x000D   lt button onclick  sortPeoples   surname     printPeoples    gt sort by ONLY by surname ASC results in mess with same name cases lt  button gt  lt br gt  x000D   lt button onclick  sortPeoples   surname    name    true   printPeoples    gt sort by surname then name DESC lt  button gt  lt br gt  x000D   lt button onclick  sortPeoples   age     printPeoples    gt sort by AGE ASC  Same issue as in first case lt  button gt  lt br gt  x000D   lt button onclick  sortPeoples   age    surname     printPeoples    gt sort by AGE and Surname ASC  Adding second field fixed it  lt  button gt  lt br gt  x000D           x000D       lt div id  output  gt  lt  div gt  x000D       lt  body gt  x000D     lt  html gt  x000D   x000D   x000D

User · Answer

I will give you a solution implementing selectionSort algorithm  it is simple and effective  var objs        first nom   Lazslo   last nom   Jamf           first nom   Pig      last nom   Bodine         first nom   Pirate   last nom   Prentice         function selection Sort num        console log num      var temp  index   for  var i   0  i  lt   num length - 1  i      index   i  for  var j   i   1  j  lt   num length - 1  j          you can use first nom last nom any way you choose to sort    if  num j   last nom  lt  num index   last nom        index   j            below is the swapping part temp   num i   last nom  num i   last nom   num index   last nom  num index   last nom   temp       console log num     return num         selection Sort objs     Great to see such great answers

User · Answer

Using xPrototype  https   github com reduardo7 xPrototype blob master README md sortbycol1-col2-coln  var o          Name   Lazslo   LastName   Jamf             Name   Pig      LastName   Bodine           Name   Pirate   LastName   Prentice         Name   Pag      LastName   Bodine              Original o each function  a  b    console log a  b           0 Object  Name   Lazslo   LastName   Jamf    1 Object  Name   Pig   LastName   Bodine    2 Object  Name   Pirate   LastName   Prentice    3 Object  Name   Pag   LastName   Bodine           Sort By LastName ASC  Name ASC o sortBy  LastName    Name   each function a  b    console log a  b           0 Object  Name   Pag   LastName   Bodine    1 Object  Name   Pig   LastName   Bodine    2 Object  Name   Lazslo   LastName   Jamf    3 Object  Name   Pirate   LastName   Prentice           Sort by LastName ASC and Name ASC o sortBy  LastName  asc   Name  asc  each function a  b    console log a  b           0 Object  Name   Pag   LastName   Bodine    1 Object  Name   Pig   LastName   Bodine    2 Object  Name   Lazslo   LastName   Jamf    3 Object  Name   Pirate   LastName   Prentice           Sort by LastName DESC and Name DESC o sortBy  LastName  desc   Name  desc  each function a  b    console log a  b           0 Object  Name   Pirate   LastName   Prentice    1 Object  Name   Lazslo   LastName   Jamf    2 Object  Name   Pig   LastName   Bodine    3 Object  Name   Pag   LastName   Bodine           Sort by LastName DESC and Name ASC o sortBy  LastName  desc   Name  asc  each function a  b    console log a  b           0 Object  Name   Pirate   LastName   Prentice    1 Object  Name   Lazslo   LastName   Jamf    2 Object  Name   Pag   LastName   Bodine    3 Object  Name   Pig   LastName   Bodine

User · Answer

Hers a function you can use to sort the list by multiple objects  where if the first object is equal  the second order will be used as a fallback  empty values should also be ignored to fallback order if possible   function sortObjects list  orderBy       list sort function a  b           let byIndex   0          let order   orderBy byIndex           while  a order by      b order by     a order by      b order by                byIndex                if byIndex  gt   orderBy length  break               order   orderBy byIndex                     if  a order by      b order by     a order by      b order by                return false                    if order desc               return a order by   lt  b order by                     return a order by   gt  b order by               return list      usage   var objs          a  10  b  20  c  30        a  30  b  10  c  20        a  20  b  10  c  30       sortObjectList objs    by   a             a  10  b  20  c  30        a  20  b  10  c  30        a  30  b  10  c  20      sortObjectList objs    by   a   desc  true            a  30  b  10  c  20        a  20  b  10  c  30        a  10  b  20  c  30      sortObjectList objs    by   b   desc  true    by   c             a  10  b  20  c  30        a  30  b  10  c  20        a  20  b  10  c  30       another example   var objs          a  5  b  5        a  10  b  15        a  15  b  25        b  10        b  20        a  10  b  30        a  10  b  12       sortObjectList objs    by   a     by   b             a  5  b  5        b  10        a  10  b  12        a  10  b  15        b  20        a  10  b  30        a  15  b  25

User · Answer

Deep Based on this excellent tutorial I would like to develop Vlad Bezden answer and explain why localeCompare is better than standard comarison method like strA  gt  strB  Lets run this example  x000D   x000D  console log     sterreich   gt   Zealand         We expect false console log   a   gt   Z                        We expect false x000D   x000D   x000D   The reason is that in JS all strings are encoded using UTF-16 and  x000D   x000D  let str           order of characters in JS for  let i   65  i  lt   220  i        str    String fromCodePoint i      code to character    console log str   x000D   x000D   x000D   Capital letters go first  have small codes  and then go small letters and then go character     after z   This is reason why we get true in first snippet - becasue operator  gt  compare characters codes  As you can see compare characters in diffrent languages is non trivial task - but luckily  modern browsers support the internationalization standard ECMA-402  So in JS we have strA localeCompare strB  which do the job  -1 means strA is less than strB  1 means opposite  0 means equal   x000D   x000D  console log     sterreich  localeCompare  Zealand         We expect -1 console log   a  localeCompare  Z                        We expect -1 x000D   x000D   x000D   I would like to add that localeCompare supports two parameters  language and additional rules   x000D   x000D  var objs            first nom   Lazslo   last nom   Jamf               first nom   Pig      last nom   Bodine             first nom   Pirate   last nom   Prentice           first nom   Test     last nom   jamf             objs sort  a b   gt  a last nom localeCompare b last nom  en   sensitivity  case      console log objs       in   gt   comparison  Jamf  will NOT be next to  jamf  x000D   x000D   x000D

User · Answer

In ES6 ES2015 or later you can do this way   objs sort  a  b    gt  a last nom localeCompare b last nom      Prior to ES6 ES2015  objs sort function a  b        return a last nom localeCompare b last nom

User · Answer

Using lodash or Underscore  its a piece of cake    gt  const sortedList     orderBy objs   last nom    asc       asc or desc

User · Answer

I haven t seen this particular approach suggested  so here s a terse comparison method I like to use that works for both string and number types   x000D   x000D  const objs          first nom   Lazslo   last nom   Jamf             first nom   Pig      last nom   Bodine           first nom   Pirate   last nom   Prentice        const sortBy   fn   gt      const cmp    a  b    gt  - a  lt  b       a  gt  b     return  a  b    gt  cmp fn a   fn b        const getLastName   o   gt  o last nom  const sortByLastName   sortBy getLastName    objs sort sortByLastName   console log objs map getLastName    x000D   x000D   x000D   Explanation of sortBy   sortBy   accepts a fn that selects a value from an object to use in comparison  and returns a function that can be passed to Array prototype sort    In this example  we re comparing o last nom  Whenever we receive two objects such as a     first nom   Lazslo   last nom   Jamf    b     first nom   Pig   last nom   Bodine     we compare them with  a  b    gt  cmp fn a   fn b    Given that fn   o   gt  o last nom  we can expand the comparison function to  a  b    gt  cmp a last nom  b last nom   Because of the way logical OR      works in JavaScript  cmp a last nom  b last nom  is equivalent to if  a last nom  lt  b last nom  return -1  if  a last nom  gt  b last nom  return 1  return 0   Incidentally  this is called the three-way comparison  quot spaceship quot    lt   gt   operator in other languages  Finally  here s the ES5-compatible syntax without using arrow functions   x000D   x000D  var objs          first nom   Lazslo   last nom   Jamf             first nom   Pig      last nom   Bodine           first nom   Pirate   last nom   Prentice        function sortBy fn      function cmp a  b    return - a  lt  b       a  gt  b       return function  a  b    return cmp fn a   fn b          function getLastName o    return o last nom    var sortByLastName   sortBy getLastName    objs sort sortByLastName   console log objs map getLastName    x000D   x000D   x000D

User · Answer

So here is one sorting algorithm which can sort in any order   throughout array of any kind of objects   without the restriction of datatype comparison   i e  Number   String    function smoothSort items prop reverse          var length   items length      for  var i    length - 1   i  gt   0  i--              Number of passes         for  var j    length - i   j  gt  0  j--                  Compare the adjacent positions             if reverse                 if  items j  prop   gt  items j - 1  prop                       Swap the numbers                 var tmp   items j                   items j    items j - 1                   items j - 1    tmp                                           if  reverse                 if  items j  prop   lt  items j - 1  prop                         Swap the numbers                   var tmp   items j                     items j    items j - 1                     items j - 1    tmp                                                     return items       the first argument items is the array of objects    prop is the key of the object on which you want to sort   reverse is a boolean parameter which on being true results in Ascending  order and in false it returns descending order

User · Answer

It s easy enough to write your own comparison function  function compare  a  b       if   a last nom  lt  b last nom        return -1        if   a last nom  gt  b last nom        return 1        return 0     objs sort  compare     Or inline  c o Marco Demaio   objs sort  a b    gt   a last nom  gt  b last nom    1     b last nom  gt  a last nom    -1   0

User · Answer

Acording your example  you need to sort by two fields  last name  first name   rather then one  You can use Alasql library to make this sort in one line   var res   alasql  SELECT   FROM   ORDER BY last nom  first nom   objs      Try this example at jsFiddle

User · Answer

Sorting  more  Complex Arrays of Objects  Since you probably encounter more complex data structures like this array  I would expand the solution    TL DR     Are more pluggable version based on  ege-  zcan s very lovely answer    Problem  I encountered the below and couldn t change it  I also did not want to flatten the object temporarily  Nor did I want to use underscore   lodash  mainly for performance reasons and the fun to implement it myself   var People         Name   name   Name   surname   Surname    Middlename   JJ        Name   name   AAA   surname   ZZZ    Middlename  Abrams        Name   name   Name   surname   AAA    Middlename   Wars        Goal  The goal is to sort it primarily by People Name name and secondarily by People Name surname  Obstacles  Now  in the base solution uses bracket notation to compute the properties to sort for dynamically  Here  though  we would have to construct the bracket notation dynamically also  since you would expect some like People  Name name   would work - which doesn t    Simply doing People  Name    name    on the other hand  is static and only allows you to go down the n-th level   Solution  The main addition here will be to walk down the object tree and determine the value of the last leaf  you have to specify  as well as any intermediary leaf   var People         Name   name   Name   surname   Surname    Middlename   JJ        Name   name   AAA   surname   ZZZ    Middlename  Abrams        Name   name   Name   surname   AAA    Middlename   Wars       People sort dynamicMultiSort   Name   name      Name    -surname         Results in           Name    name   AAA   surname   ZZZ     Middlename   Abrams            Name    name   Name   surname   Surname     Middlename   JJ            Name    name   Name   surname   AAA     Middlename   Wars          same logic as above  but strong deviation for dynamic properties  function dynamicSort properties      var sortOrder   1       determine sort order by checking sign of last element of array   if properties properties length - 1  0       -         sortOrder   -1         Chop off sign     properties properties length - 1    properties properties length - 1  substr 1         return function  a b        propertyOfA   recurseObjProp a  properties      propertyOfB   recurseObjProp b  properties      var result    propertyOfA  lt  propertyOfB    -1    propertyOfA  gt  propertyOfB    1   0      return result   sortOrder                 Takes an object and recurses down the tree to a target leaf and returns it value     param   Object  root - Object to be traversed      param   Array  leafs - Array of downwards traversal  To access the value   parent   child   value    - gt    parent   child       param   Number  index - Must not be set  since it is implicit      return  String Number        The property  which is to be compared by sort      function recurseObjProp root  leafs  index      index   index   index   0   var upper   root      walk down one level   lower   upper leafs index        Check if last leaf has been hit by having gone one step too far       If so  return result from last step    if   lower        return upper          Else  recurse    index        HINT  Bug was here  for not explicitly returning function      https   stackoverflow com a 17528613 3580261   return recurseObjProp lower  leafs  index            Multi-sort your array by a set of properties     param     Array  Arrays to access values in the form of   parent   child   value    - gt    parent   child       return  Number  Number - number for sort algorithm     function dynamicMultiSort       var args   Array prototype slice call arguments      slight deviation to base    return function  a  b        var i   0  result   0  numberOfProperties   args length         REVIEW  slightly verbose  maybe no way around because of   sort - s nature        Consider    forEach        while result     0  amp  amp  i  lt  numberOfProperties          result   dynamicSort args i   a  b         i              return result          Example  Working example on JSBin

User · Answer

Simple and quick solution to this problem using prototype inheritance   Array prototype sortBy   function p      return this slice 0  sort function a b        return  a p   gt  b p     1    a p   lt  b p     -1   0            Example   Usage  objs     age 44 name  vinay    age 24 name  deepak    age 74 name  suresh      objs sortBy  age       Returns       age  24  name   deepak     age  44  name   vinay     age  74  name   suresh     objs sortBy  name       Returns       age  24  name   deepak     age  74  name   suresh     age  44  name   vinay      Update  No longer modifies original array

User · Answer

Example Usage   objs sort sortBy  last nom       Script            description    Returns a function which will sort an    array of objects by the given key         param   String   key     param   Boolean  reverse     return  Function      const sortBy    key  reverse    gt          Move smaller items towards the front      or back of the array depending on if      we want to sort the array in reverse      order or not    const moveSmaller   reverse   1   -1        Move larger items towards the front      or back of the array depending on if      we want to sort the array in reverse      order or not    const moveLarger   reverse   -1   1               param      a       param      b       return  Number          return  a  b    gt        if  a key   lt  b key           return moveSmaller            if  a key   gt  b key           return moveLarger            return 0

User · Answer

For fp-holics  const objectSorter    p   gt  a b   gt   a b   gt a gt b 1 a lt b -1 0  a p   b p    objs sort objectSorter  first nom

User · Answer

Warning  Using this solution is not recommended as it does not result in a sorted array  It is being left here for future reference  because the idea is not rare   objs sort function a b  return b last nom gt a last nom

User · Answer

It is also possible to make a dynamic sorting function when programming in TypeScript  but the types become more tricky in this case     function sortByKey lt O gt  key  keyof O  decending  boolean   false    a  O  b  O    gt  number       const order   decending   -1   1      return  a  b   number   gt            const valA   a key           const valB   b key           if  valA  lt  valB                return -order            else if  valA  gt  valB                return order            else               return 0                      This can be used in TypeScript as the following     const test                   id  0                       id  2           test sort sortByKey  id       OK test sort sortByKey  id1       ERROR test sort sortByKey         ERROR

User · Answer

Try this   UPTO ES5    Ascending Sort items sort function  a  b       return a value - b value          Descending Sort items sort function  a  b       return b value - a value        IN ES6  amp  above      Ascending sort items sort  a  b    gt  a value - b value       Descending Sort  items sort  a  b    gt  b value - a value

User · Answer

Instead of using a custom comparison function  you could also create an object type with custom toString   method  which is invoked by the default comparison function    function Person firstName  lastName        this firtName   firstName      this lastName   lastName     Person prototype toString   function         return this lastName          this firstName     var persons     new Person  Lazslo    Jamf         persons sort

User · Answer

It works for me  Here It will keep undefined to the end     x000D   x000D   function sort items  property  direction    x000D   x000D      function compare a  b    x000D        if  a property   amp  amp   b property     x000D          return 0  x000D          else if a property   amp  amp   b property     x000D          return -1  x000D          else if  a property   amp  amp  b property     x000D          return 1  x000D          else   x000D          const value1   a property  toString   toUpperCase       ignore upper and lowercase x000D          const value2   b property  toString   toUpperCase       ignore upper and lowercase x000D          if  value1  lt  value2    x000D            return direction     0   -1   1  x000D            else if  value1  gt  value2    x000D            return direction     0   1   -1  x000D            else   x000D            return 0  x000D            x000D           x000D          x000D        x000D       x000D      return items sort compare   x000D        x000D      x000D     var items     x000D      name   Edward   value  21    x000D      name   Sharpe   value  37    x000D      name   And   value  45    x000D      name   The   value  -12    x000D      name  undefined  value  -12    x000D      name   Magnetic   value  13    x000D      name   Zeros   value  37   x000D     x000D     console log  Ascending Order -     x000D     console log sort items   name   0    x000D     console log  Decending Order -     x000D     console log sort items   name   1    x000D       x000D       x000D   x000D   x000D

User · Answer

underscore js  use underscore  its small and awesome        sortBy  sortBy list  iterator   context    Returns a sorted copy of   list  ranked in ascending order by the results of running each value   through iterator  Iterator may also be the string name of the property   to sort by  eg  length     var objs          first nom   Lazslo  last nom   Jamf         first nom   Pig   last nom   Bodine          first nom   Pirate   last nom   Prentice        var sortedObjs     sortBy  objs   first nom

User · Answer

Given the original example   var objs            first nom   Lazslo   last nom   Jamf               first nom   Pig      last nom   Bodine             first nom   Pirate   last nom   Prentice         Sort by multiple fields   objs sort function left  right        var last nom order   left last nom localeCompare right last nom       var first nom order   left first nom localeCompare right first nom       return last nom order    first nom order        Notes   a localeCompare b  is universally supported and returns -1 0 1 if a lt b a  b a gt b respectively     in the last line gives last nom priority over first nom  Subtraction works on numeric fields  var age order   left age - right age  Negate to reverse order  return -last nom order    -first nom order    -age order

[javascript] Sort array of objects by string property value

Examples related to javascript

Examples related to arrays

Examples related to sorting

Examples related to comparison