Chapter 2. Analyzing Algorithms
This chapter introduces the terminology and notation used by theoreticians and practitioners alike in modeling the performance of algorithms in terms of computational performance and resource usage. When evaluating the runtime performance of your software program, you might be perfectly satisfied, in which case you can continue to use the application as is. But if you want to improve runtime performance, this book shows you where to start—with the program’s data structures and algorithms. You are faced with some specific questions:
- Am I solving a specific problem in the most efficient way?
-
There may be other algorithms that would significantly improve performance.
- Am I implementing an algorithm in the most efficient way?
-
There can be hidden performance costs that can be eliminated.
- Should I just buy a faster computer?
-
The exact same program will have different runtime performance based ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access