Option · Module
Algorithms and graph theory
Sorting, searching and bin packing
An algorithm is a finite list of precise instructions. Bubble sort compares neighbours and swaps; quick sort splits around a pivot. Bin packing puts items into the fewest bins: first-fit, first-fit decreasing (FFD) and full-bin methods, compared with the lower bound .
≈ 45 minGraphs and their properties
A graph is vertices joined by edges. The sum of the degrees is twice the number of edges (handshaking lemma), so the number of odd vertices is even. A connected graph is Eulerian if every vertex has even degree; a connected planar graph satisfies .
≈ 40 min