| Description |
<volumes 1-2; in 5 > : illustrations ; 24 cm |
| Contents |
Ch. 1. Introduction -- Ch. 2. Principles of Algorithm Analysis -- Ch. 3. Elementary Data Structures -- Ch. 4. Abstract Data Types -- Ch. 5. Recursion and Trees --Ch. 6. Elementary Sorting Methods -- Ch. 7. Quicksort -- Ch. 8. Mergesort -- Ch. 9. Priority Queues and Heapsort -- Ch. 10. Radix Sorting -- Ch. 11. Special-Purpose Sorts -- Ch. 12. Symbol Tables and BSTs -- Ch. 13. Balanced Trees -- Ch. 14. Hashing --Ch. 15. Radix Search -- Ch. 16. External Searching |
| Summary |
Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book |
| Notes |
Includes index |
|
Previous ed. published as: Algorithms. 1988 |
| Bibliography |
Includes bibliographical references and index |
| Subject |
C (Computer program language)
|
|
C# (Computer program language)
|
|
Computer algorithms.
|
|
Graphic methods -- Data processing.
|
| Author |
Sedgewick, Robert, 1946-
Algorithms
|
| LC no. |
97023418 |
| ISBN |
0201314525 (v. 1) |
|
0201316633 (paperback) |
|
0201702479 (v. 3, parts 6-8) |
|
0201756080 (set) |
|
9780201314526 (v. 1, parts 14) |
|
9780201316636 (v. 2, part 5) |
|
9780201702477 (v. 3, parts 68) |
|
