繁体 English 中英

就“n”而言，以下代码的时间复杂度是多少？

[英]What will be the Time Complexity of following code in terms of ‘n’?

原文 2020-01-30 20:13:06 7 0 java/ time

for(int i = 0; i < n; i++){
       for(int j = 1 ; j < k; j++){
         System.out.println(i + j);
       }
}

不应该是 O(n^2).. 但它是 O(n)

[英]What will be the time complexity of the following code?

[英]What is the time complexity of the following piece of code

[英]What is the time-complexity of the following code segment?

[英]What is time complexity of following code having 2 for loops?

[英]What will be the complexity of the following code?

[英]What is the time complexity for the following program?

[英]What's the complexity of the following code?

[英]Is the time complexity of this code O(N^2)

[英]Trying to calculate the time complexity of the following piece of code

[英]Find Time Complexity and big O of following Code

暂无

声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

相关问题 以下代码的时间复杂度是多少？下面这段代码的时间复杂度是多少以下代码段的时间复杂度是多少？以下具有 2 个 for 循环的代码的时间复杂度是多少？以下代码的复杂性是什么？以下程序的时间复杂度是多少？以下代码的复杂性是什么？是这个代码的时间复杂度O（N ^ 2）试图计算下面这段代码的时间复杂度查找以下代码的时间复杂度和大O

相关标签