Algorithm 以下代码的渐进运行时间是多少?
以下代码的渐进运行时间是多少Algorithm 以下代码的渐进运行时间是多少?,algorithm,time-complexity,big-o,Algorithm,Time Complexity,Big O,以下代码的渐进运行时间是多少 if (N % 2 == 0) // N is even for (int i = 0; i < N; i = i+1) for (int j = 0; j < N; j = j+1) A[i] = j; else // N is odd for (int i = 0; i < N; i = i+1) A[i] = i; 如果(N%2==0)//N是偶数 对于(int i=0;i
if (N % 2 == 0) // N is even
for (int i = 0; i < N; i = i+1)
for (int j = 0; j < N; j = j+1)
A[i] = j;
else // N is odd
for (int i = 0; i < N; i = i+1)
A[i] = i;
如果(N%2==0)//N是偶数
对于(int i=0;i
如果N为偶数,则运行时间为O(N^2),当N为奇数时,运行时间为O(N)。但我无法确定渐进运行时间是多少
可能的答案是:
- ~O(n)
- ~O(n^2)
- ~O(N*sqrt(N))
- ~O(n日志n)