Describe how runtime and memory grow as input size increases, usually using Big O notation.

Focus on dominant terms and ignore constants. A clear answer explains loops, nested loops, recursion depth, extra data structures, and tradeoffs between time and memory.