English version

• polskie
podział tematyczny
 
• anglojęzyczne
podział tematyczny
 
Newsletter:

• Zamów informacje o nowościach z wybranego tematu
 
Informacje:

• o księgarni

• koszty wysyłki

• kontakt

• Cookies na stronie

Algorithms in C++, Parts 1-
Fundamentals, Data Structure, Sorting, Searching

Brief Description

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.

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!

This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations.

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

Features

• Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
• Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions
• Over 100 algorithms for sorting, selection, priority queue ADTimplementations, and symbol table ADT (searching) implementations
• New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more
• Increased quantitative information about the algorithms, giving you a basis for comparing them
• Over 1000 new exercises to help you learn the properties of algorithms

Contents

Fundamentals
Chapter 1. Introduction
Chapter 2. Principles of Algorithm Analysis
Data Structures
Chapter 3. Elementary Data Structures
Chapter 4. Abstract Data Types
Chapter 5. Recursion and Trees
Sorting
Chapter 6. Elementary Sorting Methods
Chapter 7. Quicksort
Chapter 8. Merging and Mergesort
Chapter 9. Priority Queues and Heapsort
Chapter 10. Radix Sorting
Chapter 11. Special-Purpose Sorts
Searching
Chapter 12. Symbol Tables and BSTs
Chapter 13. Balanced Trees
Chapter 14. Hashing
Chapter 15. Radix Search
Chapter 16. External Searching
Index

645 + VOLUM Algorithms ic C Part 5: Graph Algorithms