Summary
This chapter provided a broad overview of the topics we’ll be dealing with in this book. We took a look at the very definition of performance. Next, we spent some time describing Big O notation for describing time and space complexity and we used it in a simple example. We learned how to analyze existing code and how to estimate its execution time. This enables us to locate potential problems without even executing the code.
In the next chapter, I will look into the topic of profiling. We will see how we can get more detailed information about the program speed, which is essential before we can start optimizing the code.
