Update snippet descriptions
This commit is contained in:
@ -3,16 +3,18 @@ title: sortedIndexBy
|
||||
tags: array,math,intermediate
|
||||
---
|
||||
|
||||
Returns the lowest index at which value should be inserted into array in order to maintain its sort order, based on a provided iterator function.
|
||||
Finds the lowest index at which a value should be inserted into an array in order to maintain its sorting order, based on the provided iterator function.
|
||||
|
||||
- Check if the array is sorted in descending order (loosely).
|
||||
- Loosely check if the array is sorted in descending order.
|
||||
- Use `Array.prototype.findIndex()` to find the appropriate index where the element should be inserted, based on the iterator function `fn`.
|
||||
|
||||
```js
|
||||
const sortedIndexBy = (arr, n, fn) => {
|
||||
const isDescending = fn(arr[0]) > fn(arr[arr.length - 1]);
|
||||
const val = fn(n);
|
||||
const index = arr.findIndex(el => (isDescending ? val >= fn(el) : val <= fn(el)));
|
||||
const index = arr.findIndex(el =>
|
||||
isDescending ? val >= fn(el) : val <= fn(el)
|
||||
);
|
||||
return index === -1 ? arr.length : index;
|
||||
};
|
||||
```
|
||||
|
||||
Reference in New Issue
Block a user