Javascript Program for Shortest Un-ordered Subarray

// JavaScript program to find shortest subarray which is
// unsorted.

// boolean function to check array elements 
// are in increasing order or not
function increasing(a, n) {
    for (let i = 0; i < n - 1; i++)
        if (a[i] >= a[i + 1])
            return false;

    return true;
}

// boolean function to check array elements 
// are in decreasing order or not
function decreasing(arr, n) {
    for (let i = 0; i < n - 1; i++)
        if (arr[i] < arr[i + 1])
            return false;

    return true;
}

function shortestUnsorted(a, n) {

    // increasing and decreasing are two functions.
    // if function return true value then print
    // 0 otherwise 3.
    if (increasing(a, n) == true ||
        decreasing(a, n) == true)
        return 0;
    else
        return 3;
}

// Driver Code

let ar = [7, 9, 10, 8, 11];
let n = ar.length;

console.log(shortestUnsorted(ar, n));