Chapter Abstract:
Summary This chapter discusses two very different concepts about how to make your code faster. The first is the theory of algorithm analysis: big‐O notation and how to de...Show MoreMetadata
Chapter Abstract:
Summary
This chapter discusses two very different concepts about how to make your code faster. The first is the theory of algorithm analysis: big‐O notation and how to design code that scales well even as your dataset becomes large. The second topic is the memory system of your computer – including RAM and the various levels of the cache – and how it can give massive speedups even for modest‐sized datasets. Both theoretical math and close‐to‐the‐metal hardware consideration come to bear on making your code as fast as you need it to be.
Page(s): 269 - 281
Copyright Year: 2025
Edition: 2
ISBN Information: