a.2 algorithm design & theory
Computers are only as smart as the instructions we give them. This strand explores how we design those instructions to be fast, efficient, and logically sound.
Discover how the 'on/off' rules of Boolean logic bridge the gap between abstract math and the physical electronic circuits that power every computer.
Learn how to create step-by-step solutions and use formal tools like Big O notation to prove your code is fast and efficient as the amount of data grows.
Master a "toolkit" of proven, world-class solutions for common tasks like sorting, searching, and encrypting data so you never have to reinvent the wheel.
Use code to build virtual versions of the real world—from weather systems to fish tanks—to safely predict what might happen in the future.
Explore the deep history and future of computing, from the first mechanical algorithms to the fundamental limits of what even the most powerful machines can solve.
Last modified: February 9th, 2026
