如何写出时间复杂度增长最快的算法？O(n!)算是最快的吗？

function l(t) {
    return t.length - 1;
}

var n = 1;

function e(t) {
    if (t[l(t)] == 0) {
        t.splice(t[l(t)], 1);
        if (l(t) > 1) {
            for (let i = 0; i < n; i++) {
                t.push(t[l(t) - 1]);
            }
        }
    }
    if (t[l(t)] > 0 && typeof t == "number") {
        for (let i = l(t); t[i] < t[l(t)]; i--) {
        }
        var s;
        for (let j = i; j <= l(t); j++) {
            s.push(t[j]);
        }
        var sa = s;
        sa[j] = sa[i] - 1;
        sa[l(sa)] = 0;
        t.splice(t[l(t)], 1);
        for (let k = 0; k <= l(sa); k++) {
            t.push(sa[k]);
        }
    }
    if (t[l(t)] == "w") {
        t[l(t)] = n + 1;
    }
    n += 1;
    return t;
}

function monster(k) {
    i = ["+", 0];
    for (let l = 0; l < k - 2; l++) {
        i.push("w")
    }
    while (l(i) >= 0) {
        i = e(i);
    }
    return n;
}

monster(3)