COMP1201: Algorithmics

What the module covered

This module covered algorithm design and the analysis of time and space complexity. We compared how algorithms behave as their inputs grow, including best, average, and worst-case running times.

The data structures side covered abstract data types, lists, stacks, queues, maps, and sets, alongside recursion, search trees, balancing, heaps, and graph algorithms. The emphasis was on understanding how a structure’s implementation affects the cost of its operations and which problems it suits.

What I took from it

Many of these algorithms and data structures are already available in programming libraries, but understanding their behaviour helps me choose between them. It is tempting to dive straight into coding; planning a solution first, even through a few paper sketches, can help avoid unnecessary complexity and inefficiency.