binary-search-insert
A library for performing a binary search and insert into a sorted array.
Binary search has an average time complexity of O(log(n)) which is substantially faster than a linear search
with an average time complexity of O(n).
Installing
$ npm install binary-search-insert
Usage
var binarySearchInsert = ;var sortedArray = 1 3 5 7 9 11;var { return a - b; } /** * Mutates sortedArray and returns index of inserted value * @param * @param * @param * argument will be a member of sortedArray, the second argument will be item. * If item < member, return value < 0 * If item > member, return value > 0 * @returns */var indexInsertedAt = ;// indexInsertedAt: 3// sortedArray: [1, 3, 5, 6, 7, 9, 11]
Benchmarks
http://jsperf.com/cflynn07-binary-search-insert-vs-linear-search-insert
Testing
// Tests + coverage reports are run using Lab
$ npm test
// Test coverage reports
$ npm run test-cov # will auto-open Google Chrome with html coverage report