Springer – 2009, 272 p.
ISBN: 1441917470, 9781441917478
New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more.
Variables, expressions, assignments.
Generation of combinatorial objects.
Tree traversal (backtracking).
Sorting.
Finite-state algorithms in text processing.
Data types.
Recursion.
Recursive and nonrecursive programs.
Graph algorithms.
Pattern matching.
Set representation.
Hashing.
Sets, trees, and balanced trees.
Context-free grammars.
Left-to-right parsing (LR).
Further reading.