Big-Oh defined (the fun way )

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

Explainer

Big O Notation is like a superhero rating system for algorithms! It tells how fast or memory-hungry an algorithm gets as the input size (n) grows. By comparing these "ratings," we can pick the most efficient hero to save the day with the best performance!