45 lines
1.1 KiB
JavaScript
45 lines
1.1 KiB
JavaScript
|
(function (exports) {
|
||
|
|
'use strict';
|
||
|
|
|
||
|
|
function compare(a, b) {
|
||
|
|
return a - b;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Insertionsort algorithm.<br><br>
|
||
|
|
* Time complexity: O(N^2).
|
||
|
|
*
|
||
|
|
* @example
|
||
|
|
*
|
||
|
|
* var sort = require('path-to-algorithms/src' +
|
||
|
|
* '/sorting/insertion-sort').insertionSort;
|
||
|
|
* console.log(sort([2, 5, 1, 0, 4])); // [ 0, 1, 2, 4, 5 ]
|
||
|
|
*
|
||
|
|
* @public
|
||
|
|
* @module sorting/insertionsort
|
||
|
|
* @param {Array} array Input array.
|
||
|
|
* @param {Function} cmp Optional. A function that defines an
|
||
|
|
* alternative sort order. The function should return a negative,
|
||
|
|
* zero, or positive value, depending on the arguments.
|
||
|
|
* @return {Array} Sorted array.
|
||
|
|
*/
|
||
|
|
function insertionSort(array, cmp) {
|
||
|
|
cmp = cmp || compare;
|
||
|
|
var current;
|
||
|
|
var j;
|
||
|
|
for (var i = 1; i < array.length; i += 1) {
|
||
|
|
current = array[i];
|
||
|
|
j = i - 1;
|
||
|
|
while (j >= 0 && cmp(array[j], current) > 0) {
|
||
|
|
array[j + 1] = array[j];
|
||
|
|
j -= 1;
|
||
|
|
}
|
||
|
|
array[j + 1] = current;
|
||
|
|
}
|
||
|
|
return array;
|
||
|
|
}
|
||
|
|
|
||
|
|
exports.insertionSort = insertionSort;
|
||
|
|
|
||
|
|
})(typeof window === 'undefined' ? module.exports : window);
|