tompa@GEODUCK.CS.WASHINGTON.EDU (02/06/90)
Can anyone recommend a good undergraduate textbook on data structures and algorithms? I would like it to pass 2 tests: 1. It covers most or all of the standard material, e.g., dictionaries (hashing, balanced trees), priority queues (heaps), union-find, sorting, graph traversal, Dijkstra's algorithm, and Kruskal's algorithm. 2. It practices (as opposed to preaching) abstract data types. A typical test might be whether the buckets in open hashing (a.k.a. external chaining) are implemented using the LIST abstract data type preached in an earlier chapter, as opposed to reinventing some specific implementation such as linked lists with pointers. Please send replies to tompa@cs.washington.edu Martin Tompa