Find the minimum value in that array in O(n) or less.

minimumValue.js

//Given an array that was once sorted in ascending order is rotated at some pivot unknown to you beforehand (so [0,2,4,7,9] //might become [7,9,0,2,4], for example). Find the minimum value in that array in O(n) or less.

const arr = [7, 9, 0, 2, 4];

const getMinValue = (arr) => {
    let left = 1;
    let right = arr.length - 1;
    let min = arr[0];

    while (left < right) {
        if (arr[left] < arr[right]) {
            min = Math.min(min,arr[left]);
            left++;
        } else {
            min = Math.min(min, arr[right]);
            right--;
        }
    }
    return min;
}

getMinValue(arr);
//0