我试图找出这个伪代码给定算法的时间复杂度:
sum = 0; for (i = 1; i <= n; i++) for (j = 1; j <= n / 6; j++) sum = sum + 1;
我知道第一条线路运行
n次
但我不确定第二行.
c algorithm complexity-theory big-o time-complexity
algorithm ×1
big-o ×1
c ×1
complexity-theory ×1
time-complexity ×1