Are you familiar with Big O notation?

Big O notation is used to estimate the asymptotic complexity of algorithms, meaning it shows how the execution time or memory usage grows with increasing input size. For example, an algorithm with a complexity of O(n) will run proportionally to the input size, while one with O(n²) will be proportional to the square of the size. This helps compare the efficiency of algorithms and choose optimal solutions.