Chapter 8. Performance and Algorithm Efficiency
In this chapter, we are going to see algorithms in terms of performance and efficiency. We have been implementing different algorithms in previous chapters, and now we are going to explain how we can measure them, in theory and in practice. We are going to use the help of asymptotic analysis and Big-O notation to classify and compare algorithms.
The topics covered are as follows:
- Algorithm efficiency
- Measuring efficiency
- Big-O notation
- Orders of common functions
- Evaluating runtime complexity
