It's time to take it to the next level people. So far we can sort arrays by strings, we can sort arrays by numbers and we can do either in descending order. I'm not unhappy with the present approach myself and so I'll leave it as is. If you'd rather not have a function wrapping a function inline then you could create stringComparerDescending, a numberComparerDescending etc implementations. Let's start with ordering by string properties: With that in mind, we're going to create comparer functions which will take a lambda / arrow function (ES6 alert!) and return a function which will compare based on the supplied lambda. Sort also returns the array to the caller which is nice for chaining and means we can use it in a similar fashion to the way we use OrderBy. If preserving the original order of my array was important to me (spoiler: mostly it isn't) then I could make a call to slice prior to calling sort. However, OrderBy returns an IOrderedEnumerable which when iterated returns the items of the collection in a particular order. sort actually changes the order of the array. See what I did there?īefore we get going it's worth saying that LINQ's OrderBy and JavaScript's sort are not the same thing. We want to use the sort function to introduce some LINQ-ish ordering goodness. If omitted, the array is sorted according to each character's Unicode code point value, according to the string conversion of each element. Specifies a function that defines the sort order. It is fantastically convenient, expressive and something I've been missing in JavaScript.

The ability to simply expose a collection of objects in a given order with a relatively terse and descriptive syntax. It got me thinking about one of favourite features of LINQ: ordering using OrderBy, ThenBy. What if I told you that JavaScript has LINQ? I was recently reading a post by Jaime González García which featured the following mind-bending proposition:

Tinypng alternative