Time, Space and Speed Trade-offs

Starter: think before typing

Before running this efficiency example, find the line where the main idea becomes active. Write a prediction: what must already be true for that line to work, and what should be different after it runs? The checked run ends with `List contains Ada? true Ada mark by key: 72`; predict how the focus line helps produce that evidence.

Learning Objectives

• Explain time and space as practical trade-offs.
• Compare linear search with map lookup.
• Recognise when readability is more valuable than micro-optimisation.
• Use simple measurements carefully.

Learning Outcomes

• By the end of the lesson, you can explain time and space as practical trade-offs.
• By the end of the lesson, you can compare linear search with map lookup.
• By the end of the lesson, you can recognise when readability is more valuable than micro-optimisation.
• By the end of the lesson, you can use simple measurements carefully.

Why this idea exists

Efficiency is about trade-offs, not simply making everything faster. Computer science has long studied how algorithms use time and memory because the right design can change what is feasible.

Hardware has become faster, but data and expectations have grown too. A solution that is fine for ten records may fail for ten million, while a highly optimised solution may be harder to read and maintain.

Degree-level judgement means matching the optimisation to the evidence. Measure when useful, reason about scale, and explain why the chosen approach is appropriate for the problem.

Deep dive

Lesson visual

Type this and run it

Create TimeSpaceSpeedTradeoffsDemo.java, type the program, and run it before changing anything. This section is about reproducing the checked baseline.

import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class TimeSpaceSpeedTradeoffsDemo {
  public static void main(String[] args) {
    List<String> names = List.of("Ada", "Grace", "Alan");
    Map<String, Integer> marksByStudent = new HashMap<>();
    marksByStudent.put("Ada", 72);
    System.out.println("List contains Ada? " + names.contains("Ada"));
    System.out.println("Ada mark by key: " + marksByStudent.get("Ada"));
  }
}

Build and run it with:

javac TimeSpaceSpeedTradeoffsDemo.java && java TimeSpaceSpeedTradeoffsDemo

Expected baseline: List contains Ada? true Ada mark by key: 72

Line-by-line explanation

Read the code as a sequence of responsibilities. The focus line for this lesson is System.out.println("Ada mark by key: " + marksByStudent.get("Ada"));; the surrounding lines prepare it, use its result or make the behaviour observable.

Worked example

Trace the program

Common misconception

A common mistake in time, space and speed trade-offs is treating the example as a finished answer. For efficiency, the important question is narrower: which operation carries the idea, what does it make possible, and what would break if you changed it carelessly?

Quick checks

How to study this lesson

For Time, Space and Speed Trade-offs, predict how efficiency changes the run before you press Run.

Use the first portfolio task as your main edit: Compare two lookup approaches.

Use the second task as your variation: Estimate which scales better.

Finish with evidence, not a diary entry: Write a note explaining the chosen trade-off.

Portfolio Practice

1. Compare two lookup approaches.
2. Estimate which scales better.
3. Write a note explaining the chosen trade-off.

Final self-check

Study route

Practise efficiency by predicting the Java example, typing it, running it in the browser, tracing the result and saving portfolio evidence.

Next, move into Interfaces and Higher-Level Abstractions and carry forward one improvement from this lesson into the next program.