algorithm and data structure15 July 2025Outline

Algorithm & Data Structure

The efficiency, structure, and trade-offs behind computation.

Reading guide

These notes connect an algorithm’s representation choices to its correctness and cost. Begin with asymptotic complexity, then extend graph search to state-space search. Future topics include sorting, dynamic programming, graph algorithms, and amortized analysis. Some learning context comes from FIT2004 and CLRS; each note develops its own explanations and examples.

Reading path

Algorithm Complexity
A note on time complexity, asymptotic notation, input-size modelling, and linear-search analysis with publication-style pseudocode.
Generalizing Graph Search to State Space Search
A course-derived note on viewing Dijkstra, UCS, A*, weighted A*, and greedy search as choices of an evaluation function over a state space.