Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Salient Features* The first half of the most important work on computer algorithms completely revised, greatly expanded, and completely up-to-date.* By blending theory and practice, this book appeals equally to both the academic and professional markets.* Previously announced - lots of pent-up demand. Table of Contents I. Fundamentals 1. Introduction. 2. Principles of Algorithm Analysis. II. Data Structures 3. Elementary Data Structures 4. Abstract Data Types 5. Recursion and Trees III. Sorting 6. Elementary Sorting Methods 7. Quicksort 8. Mergesort 9. Priority Queues and Heaspsort 10. Radix Sorting 11. Special-Purpose Sorts IV. Searching 12. Symbol Tables and STs 13. Balanced Trees 14. Hashing Radix Search 15. External Searching