LOL. this *algorithm* is *really slow* `O(n^Infinity)`... here is a `O(2)` (best case scenario) or `O(n)` (worst case) implementation :wink: 

```js
function isSorted(arr, compare){
    compare = compare || defaultCompare;
    var prev;
    return every(arr, function(value, i){
        var sorted = !i || compare(prev, value);
        prev = value;
        return sorted;
    });
}

function defaultCompare(a, b) {
   return a <= b;
}
```