Course contentsShow
← Computer Science
Lesson 2139 of 2,87248. Programming ParadigmsFree lesson

Lazy Evaluation

Delay computation until results are needed for efficiency and infinite data structures.

Lazy Evaluation

You'll learn how delaying computation until results are actually needed can boost efficiency and enable infinite data structures.


The Core Idea

Lazy evaluation is a strategy where expressions aren't computed the moment they're defined—they're only evaluated when their values are actually required. Think of it like a restaurant menu: the kitchen doesn't prepare every dish listed; food is only cooked when someone orders it.

This stands in contrast to eager evaluation (the default in most imperative languages), where expressions are computed immediately as soon as they're encountered.

Why It Matters

Efficiency through avoidance: If you compute a value but never use it, you've wasted CPU cycles. Lazy evaluation skips that work entirely.

Infinite data structures: You can define conceptually infinite sequences (like all natural numbers) and only compute the elements you actually access. The entire sequence never needs to exist in memory at once.

Short-circuit potential: Combined with higher-order functions like filter or map, lazy evaluation can stop processing early once a condition is met, rather than transforming entire collections upfront.

Real-World Analogy

Imagine a streaming service. It doesn't download every episode of a series to your device at once (eager). Instead, it buffers and loads episodes only as you watch them (lazy). If you stop watching after episode 3, episodes 4–100 were never transferred—saving bandwidth and time.

How It Connects

Lazy evaluation pairs naturally with pure functions (no side effects means safe to delay), higher-order functions (transform data on-demand), and closures (capture the "recipe" for computing a value without computing it yet).


Key Takeaway: Lazy evaluation delays computation until results are needed, enabling both performance gains by avoiding unnecessary work and the elegant representation of infinite data structures.