Big-O notation and Time complexity in Python
Time complexity is a way to measure how the runtime of your program grows as the input size increases.
It helps you predict performance without actually running the code with huge inputs.
Input size (n) - the number of elements your function processes (length of a list, number of nodes, etc). * Runtime growth - how much slower your algorithm gets when n becomes very large. Think of it âĻ