Time complexity 半大小嵌套循环的时间复杂度 void函数(int n) { 整数计数=0; //外环 对于(int i=n/2;i
假设您的代码具有完全缩进,如下所示:Time complexity 半大小嵌套循环的时间复杂度 void函数(int n) { 整数计数=0; //外环 对于(int i=n/2;i,time-complexity,big-o,nested-loops,Time Complexity,Big O,Nested Loops,假设您的代码具有完全缩进,如下所示: void function(int n) { int count = 0; // outer loop for (int i=n/2; i<=n; i++) // middle loop for (int j=1; j+n/2<=n; j = j++) // inner loop executes log n times for (i
void function(int n)
{
int count = 0;
// outer loop
for (int i=n/2; i<=n; i++)
// middle loop
for (int j=1; j+n/2<=n; j = j++)
// inner loop executes log n times
for (int k=1; k<=n; k = k * 2)
count++;
}
void函数(int n)
{
整数计数=0;
//外环
对于(int i=n/2;i
void function(int n)
{
int count = 0;
// outer loop
for (int i=n/2; i<=n; i++){
// middle loop
for (int j=1; j+n/2<=n; j++){
// inner loop executes log n times
for (int k=1; k<=n; k = k * 2){
count++;
}
}
}
}