Summary
In this chapter, we scratched the surface of a beast known as computational complexity. There is a lot more to computational complexity than we discussed in this chapter. However, the topics and examples discussed in this chapter are the ones that most of us face in our day-to-day work. There are more advanced topics in space complexity, such as LSPACE, which is a class of problems that can be solved in logarithmic space and NLSPACE, which is the amount of space but using a non-deterministic Turing machine. The main goal of this chapter is to ensure that we understand how the complexity of our algorithms is calculated and how it affects the overall output. In the next chapter, we will be discussing what kind of micro-optimizations ...
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