Ryan Hartzfeld hartz89
hartz89
/ binarySearch.js
Last active
June 21, 2019 20:36
Implementation of a binary insertion sort in es6.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| export const getInsertPosition = (value, target) => { | |
| if (target.length === 0) { | |
| return 0; | |
| } | |
| if (value < target[0]) { | |
| return 0; | |
| } | |
| const lastIndex = target.length - 1; |