Modified version of insertion sort. It uses binary search for finding
where the current element should be inserted. It's correct because
the binary search looks just in the first part of the array
which is actually sorted.
Time complexity: O(N^2).
Time complexity: O(N^2).
- Source:
Parameters:
| Name | Type | Description |
|---|---|---|
array |
Array
|
Input array. |
cmp |
function
|
Optional. A function that defines an alternative sort order. The function should return a negative, zero, or positive value, depending on the arguments. |
Returns:
- Type:
-
Array
Sorted array.
Example
var sort = require('path-to-algorithms/src' +
'/sorting/insertion-binary-sort').insertionBinarySort;
console.log(sort([2, 5, 1, 0, 4])); // [ 0, 1, 2, 4, 5 ]