#Big O

Big O notation describes how an algorithm's time or space grows as input size increases. This guide explains what Big O is, common classes like O(n) and O(log n), and why it matters for writing efficient code.