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.
Install
$ npm install --save insertionsort
Usage
var insertionsort = ; ; // => [1, 1, 2, 3, 4, 4, 5, 5, 6, 9] ;// => [1,2,3,4,5,6] // Descending order { return b - a; } ; // Works on object and sort it out. { return aage - bage };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; ;/*=> [ {"name": 'Passy', "age": 25, "place": 1}, {"name": 'Sindre', "age": 30, "place": 2}, {"name": 'Matt', "age": 35, "place": 3}, {"name": 'Stephen', "age": 40, "place": 4}]*/
License
MIT © Neil Kim Gardose