Demo: Benchmarking Caching
The lesson benchmarks uncached versus cached Fibonacci calculation for 40 numbers, revealing an astonishing 150,000x speed difference. We extend the lesson to LINQ expressions where similar exponential recalculation can occur silently, and encourage developers to identify and cache any repeated slow computation whose result is stable.
Previous Module
Pointers in C#
This Module
Advanced Performance Optimizations
Delegates in C#
Demo: Benchmarking Delegates
Class Factories in C#
Instantiating with Dynamic Methods
Demo: Benchmarking Class Instantiation
Copying Blocks of Memory
Demo: Benchmarking Memory Copy
Caching in C#
Example: Calculating Fibonacci Numbers
Demo: Benchmarking Caching