Additional sort implementation. Other search and sort implementation at Addy Osmani
A simple sort with O(n^2) complexity. Sorts array of elements with an empty array and inserts elements one at a time in their proper order.
$ npm install --save insertionsortvar insertionsort = require('insertionsort');
insertionsort([3, 1, 4, 1, 5, 9, 2, 6, 5, 4]);
// => [1, 1, 2, 3, 4, 4, 5, 5, 6, 9]
insertionsort([5,2,4,6,1,3]);
// => [1,2,3,4,5,6]
// Descending order
function comparator(a, b) { return b - a; }
insertionsort([5,2,2,6,1,3], comparator);
// Works on object and sort it out.
function comparePeople(a, b) { return a.age - b.age };
var people = [
{name: 'Sindre', age: 30, place: 2},
{name: 'Passy', age: 25, place: 1},
{name: 'Stephen', age: 40, place: 4},
{name: 'Matt', age: 35, place: 3}
];
insertionsort(people, objComparator);
/*
=> [
{"name": 'Passy', "age": 25, "place": 1},
{"name": 'Sindre', "age": 30, "place": 2},
{"name": 'Matt', "age": 35, "place": 3},
{"name": 'Stephen', "age": 40, "place": 4}
]
*/MIT © Neil Kim Gardose