DEV Community

Marstecks
Marstecks

Posted on

Big O' Notation

This is a submission for DEV Computer Science Challenge v24.06.12: One Byte Explainer.

Explainer

Ranks algorithm speed as data grows. Slow (O(n^2)) vs Fast (O(log n)) helps choose efficient code.

Additional Context

Top comments (0)