Time Complexity | Asymtopic Notations |
---|---|
T4
T5 T3 T1 T2
Most to least
T1(n) = n^20+2^n T2(n) = 10+0.05n! T3(n) = 3+n^2+n^5 T4(n) = 900000000n+log2n T5(n) = nlog2n |
|
floor(0*5/n) +1
for(i = n; i>=0; i = i-5)
|
T3
T4 T2 T1 (not sure)
Most to least
T1(n)= 2n+3^n T2(n) = 18n^2 +4n t3(n) = 100^10 T4(n) = 3n^0.8 |
n* (floor(log2n)+1)
for i = 1; i<= n i++)
for (i = 1; j <=n; j=j*2) n* (floor(log2n)+1) |
|
n(n-1)/2
for (i = 0; i
|
|
3/2n - 1/2n
for (i = n; i>=1; i= 1/3)
for (j = i; j>= i; j--) 3/2n - 1/2n |
|