An Introduction to Data Structures and Algorithms

J.A. Storer

• 09 november 2001
• 9780817642532

Samenvatting:

* Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms).



Data structures and algorithms are presented at the college level in a way that is unique in content and presentation from current available texts. A highly a highly accessible format presents algorithms with one page displays that will appeal to both students and teachers of computer science. The thirteen chapters systematically and comprehensively cover Models of Computation, Lists, Induction and Recursion, Trees, Algorithms Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Discrete Fourier Transform, Strings, Graphs, Parallel Models of Computation.