Merge pull request #1541 from yoptar/patch-1

fix: allow for shorter arrays in isSorted
This commit is contained in:
Angelos Chalaris
2020-10-13 10:17:39 +03:00
committed by GitHub

View File

@ -3,20 +3,20 @@ title: isSorted
tags: array,intermediate tags: array,intermediate
--- ---
Returns `1` if the array is sorted in ascending order, `-1` if it is sorted in descending order or `0` if it is not sorted. Returns `1` if a numeric array is sorted in ascending order, `-1` if it is sorted in descending order or `0` if it is not sorted.
- Calculate the ordering `direction` for the first two elements. - Calculate the ordering `direction` for the first pair of adjacent array elements.
- Use `Object.entries()` to loop over array objects and compare them in pairs. - Return `0` if the given array is empty, only has one element or the `direction` changes for any pair of adjacent array elements.
- Return `0` if the `direction` changes or the `direction` if the last element is reached. - Use `Math.sign()` to covert the final value of `direction` to `-1` or `1`.
```js ```js
const isSorted = arr => { const isSorted = arr => {
let direction = -(arr[0] - arr[1]); if (arr.length <= 1) return 0;
for (let [i, val] of arr.entries()) { const direction = arr[1] - arr[0];
direction = !direction ? -(arr[i - 1] - arr[i]) : direction; for (let i = 2; i < arr.length; i++) {
if (i === arr.length - 1) return !direction ? 0 : direction / Math.abs(direction); if ((arr[i] - arr[i - 1]) * direction < 0) return 0;
else if ((val - arr[i + 1]) * direction > 0) return 0;
} }
return Math.sign(direction);
}; };
``` ```
@ -24,4 +24,5 @@ const isSorted = arr => {
isSorted([0, 1, 2, 2]); // 1 isSorted([0, 1, 2, 2]); // 1
isSorted([4, 3, 2]); // -1 isSorted([4, 3, 2]); // -1
isSorted([4, 3, 5]); // 0 isSorted([4, 3, 5]); // 0
isSorted([4]); // 0
``` ```