Homework Sourse1 logN powN12 N NlogN powN 2 powN3 pow2 N pow3 N N is this w
1, logN, pow(N,1/2), N, NlogN, pow(N, 2), pow(N,3), pow(2, N), pow(3, N), N! is this written in ascending order in terms of big o complexity?
Solution
Consider this table--->
from the table given above we can say that ascending order in terms of big o complexity is right.
So the ascending order is ---> 1, logN, pow(N,1/2), N, NlogN, pow(N, 2), pow(N,3), pow(2, N), pow(3, N), N!
| n=10 | n=1000 | n=100000 | |
| 1 | 1 | 1 | 1 |
| log N | 1 | 3 | 5 |
| pow(N,1/2) | 3.16 | 31.62 | 316.22 |
| N | 10 | 1000 | 100000 |
| NlogN | 10 | 3000 | 500000 |
| pow(N,2) | 100 | 1000000 | 10000000000 |
| pow(N,3) | 1000000 | 1000000000 | 1000000000000000 |
| pow(2,N) | 1024 | 1.071e+301 | overflow |
| pow(3,N) | 59049 | 1.322e+477 | overflow |
| N! | 3628800 | 4.023e+2567 | overlow |
