Whenever you're ready, walk me through how you'd approach this.
Tell me about Big O notation, and what it is used for in software development.
Explain how Big O describes an algorithm's time and space growth as input size increases. Include one concrete example and distinguish complexity analysis from measuring an implementation's exact runtime.