Open day and nightFree admissionPlease touch the exhibits

Exhibits in this wing

Big questions in this wing

  1. What is an algorithm?

    An algorithm is a list of exact steps that solves a problem, written so clearly that a machine can follow it without understanding it. A recipe is close to one; so is the way you look up a word in a dictionary. Programs are algorithms written in a language a computer can run.

  2. Why are some algorithms faster than others?

    Because they do less work as the input grows. To sort a thousand items, a simple method such as Bubble Sort makes roughly half a million comparisons, while Merge Sort needs about ten thousand. Big-O notation, such as O(n²) and O(n log n), describes how the work grows, not the time on one particular computer.

  3. How does a computer sort a list?

    By comparing items two at a time and moving them, over and over, following a fixed plan. Different plans give different sorting algorithms: some swap neighbours, some split the list in halves and merge them back in order, some pick a pivot and separate smaller items from larger ones.