Fast stable sorting algorithm implementation in javascript

javascript algorithm sorting
William Casarin picture William Casarin · Sep 15, 2009 · Viewed 53.8k times · Source

I'm looking to sort an array of about 200-300 objects, sorting on a specific key and a given order (asc/desc). The order of results must be consistent and stable.

What would be the best algorithm to use, and could you provide an example of it's implementation in javascript?

Thanks!

Answer

Vjeux picture Vjeux · Jan 18, 2010

It is possible to get a stable sorting from a non-stable sort function.

Before sorting you get the position of all the elements. In your sort condition, if both elements are equal, then you sort by the position.

Tada! You've got a stable sort.

I've written an article about it on my blog if you want to know more about this technique and how to implement it: http://blog.vjeux.com/2010/javascript/javascript-sorting-table.html

Related questions

How do you sort an array on multiple columns?

I have a multidimensional array. The primary array is an array of [publicationID][publication_name][ownderID][owner_name] What I am trying to do is sort the array by owner_name and then by publication_name. I know in JavaScript …

Read More
Efficient way to insert a number into a sorted array of numbers?

I have a sorted JavaScript array, and want to insert one more item into the array such the resulting array remains sorted. I could certainly implement a simple quicksort-style insertion function: var array = [1,2,3,4,5,6,7,8,9]; var element = 3.5; function insert(element, array) { array.…

Read More
Javascript Array.sort implementation?

Which algorithm does the JavaScript Array#sort() function use? I understand that it can take all manner of arguments and functions to perform different kinds of sorts, I'm simply interested in which algorithm the vanilla sort uses.

Read More