DEV Community

Rajeev Ranjan
Rajeev Ranjan

Posted on

completion time for algorithms

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

Top comments (0)

👋 Kindness is contagious

Immerse yourself in a wealth of knowledge with this piece, supported by the inclusive DEV Community—every developer, no matter where they are in their journey, is invited to contribute to our collective wisdom.

A simple “thank you” goes a long way—express your gratitude below in the comments!

Gathering insights enriches our journey on DEV and fortifies our community ties. Did you find this article valuable? Taking a moment to thank the author can have a significant impact.

Okay