Approximate completion time for algorithms, N = 100
O(Log(N)) 10-7 seconds
O(N) 10-6 seconds
O(N*Log(N)) 10-5 seconds
O(N2) 10-4 seconds
O(N6) 3 minutes
O(2N) 1014 years
O(N!) 10142 years
Rajeev Ranjan
Posted on
completion time for algorithms
For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)