Function logarithmicSort

javascript/0300-longest-increasing-subsequence.js:85–102

(nums, subsequence = [])

};

var logarithmicSort = (nums, subsequence = []) => {
    for (const num of nums) {
        /* Time O(N) */
        const max = subsequence[subsequence.length - 1];

        const canAdd = max < num;
        if (canAdd) {
            subsequence.push(num);
            continue;
        } /* Space O(N) */

        const index = binarySearch(num, subsequence); /* Time O(log(N)) */

        subsequence[index] = num;
    }

    return subsequence;
};

const binarySearch = (num, subsequence) => {
    let [left, right] = [0, subsequence.length - 1];