Organization of chapters -- Introduction -- Recursion and backtracking -- Linked lists -- Stacks -- Queues -- Trees -- Priority queues and heaps -- Disjoint sets ADT -- Graph algorithms -- Sorting -- Searching -- Selection algorithms [medians] -- Symbol tables -- Hashing -- String algorithms -- Algorithms design techniques -- Greedy algorithms -- Divide and conquer algorithms -- Dynamic programming -- Complexity classes -- Miscellaneous concepts.