Uses a binary search to determine the lowest index at which value should be inserted into array in order to maintain its sort order.
value
array
The sorted array to inspect.
The value to evaluate.
Returns the index at which value should be inserted into array.
0.1.0
sortedIndex([30, 50], 40)// => 1 Copy
sortedIndex([30, 50], 40)// => 1
Uses a binary search to determine the lowest index at which
valueshould be inserted intoarrayin order to maintain its sort order.