Data Structures and Algorithms in C++ / Edition 4

Data Structures and Algorithms in C++ / Edition 4

by Adam Drozdek
     
 

ISBN-10: 1133608426

ISBN-13: 9781133608424

Pub. Date: 08/27/2012

Publisher: Cengage Learning


Strengthen your understanding of data structures and their algorithms for the foundation you need to successfully design, implement and maintain virtually any software system. Theoretical, yet practical, DATA STRUCUTRES AND ALGORITHMS IN C++, 4E by experienced author Adam Drosdek highlights the fundamental connection between data structures and their algorithms,…  See more details below

Overview


Strengthen your understanding of data structures and their algorithms for the foundation you need to successfully design, implement and maintain virtually any software system. Theoretical, yet practical, DATA STRUCUTRES AND ALGORITHMS IN C++, 4E by experienced author Adam Drosdek highlights the fundamental connection between data structures and their algorithms, giving equal weight to the practical implementation of data structures and the theoretical analysis of algorithms and their efficiency. This edition provides critical new coverage of treaps, k-d trees and k-d B-trees, generational garbage collection, and other advanced topics such as sorting methods and a new hashing technique. Abundant C++ code examples and a variety of case studies provide valuable insights into data structures implementation. DATA STRUCTURES AND ALGORITHMS IN C++ provides the balance of theory and practice to prepare readers for a variety of applications in a modern, object-oriented paradigm.

Read More

Product Details

ISBN-13:
9781133608424
Publisher:
Cengage Learning
Publication date:
08/27/2012
Edition description:
New Edition
Pages:
816
Sales rank:
1,027,455
Product dimensions:
7.60(w) x 9.20(h) x 1.40(d)

Table of Contents


1. Object-Oriented Programming Using C++. 2. Complexity Analysis. 3. Linked Lists. 4. Stacks and Queues. 5. Recursion. 6. Binary Trees. 7. Multiway Trees. 8. Graphs. 9. Sorting. 10. Hashing. 11. Data Compression. 12. Memory Management. 13. String Matching. Appendix A: Computing BIG-O. Appendix B: Algorithms in the Standard Template Library. Appendix C: NP-Completeness.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >