Chapter two
2.1 Computational Tractability
2.2 Asymptotic Order of Growth
2.3 Implementing The Stable Matching Algorithm using Lists and Arrays
2.4 A survey of Common Running Times
2.5 A More Complex Data Structure: Priority Queues