这个函数的时间复杂度是 O(n * (n * log n² ))

Question

下面函数的时间复杂度是多少？ n > 0

Function fun(n){
    Let count = 0;

    For( I = 0; I < n; I++){

        For(j = 0; j < n; j /= 2) {

            For(h = 0; h < n; h /= 2) {

                Count = count + 1;
            }
        }
    }
    Return count;
}

我有 O(n * (n * log n² )) ，但有些事情告诉我我可能错了。

Answer 1

上面的循环是一个无限循环。除非正确更新问题陈述，否则无法确定时间复杂度！

Function fun(n){
    Let count = 0;

    For( I = 0; I < n; I++){
        // will run infinitely even if you change j /= 2 to j *= 2, because initial value is 0
        For(j = 0; j < n; j /= 2) {
            // will run infinitely even if you change h /= 2 to h *= 2, because initial value is 0
            For(h = 0; h < n; h /= 2) {

                Count = count + 1;
            }
        }
    }
    Return count;
}