Example: Calculating Fibonacci Numbers
We use the recursive Fibonacci sequence as a concrete example of accidental exponential complexity, where calculating n numbers triggers exponential recursive calls. The lesson introduces a dictionary-backed cache that stores each computed value so every Fibonacci number is calculated exactly once, then previews the expected performance difference.
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