Library Banner
Image from Google Jackets

Data structures and algorithm analysis in C++ / Mark Allen Weiss

By: Material type: TextPublication details: Harlow : Pearson Education, 2014Edition: 4th edDescription: 653 pISBN:
  • 9780273769385
Subject(s): DDC classification:
  • T 005.13 WEI-D
Summary: This is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language. This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss careful, rigorous and in-depth analysis of each type of algorithm
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Current library Call number Copy number Status Barcode
UMT Main Campus 005.13 WEI-D (Browse shelf(Opens below)) Available 154306
UMT Main Campus 005.13 WEI-D (Browse shelf(Opens below)) C.2 Available 154307
UMT Main Campus 005.13 WEI-D (Browse shelf(Opens below)) C.3 Available 154308
UMT Main Campus 005.13 WEI-D (Browse shelf(Opens below)) C.4 Available 154309
UMT Main Campus 005.13 WEI-D (Browse shelf(Opens below)) C.5 Available 154310

Index present

This is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language. This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss careful, rigorous and in-depth analysis of each type of algorithm

Eng

There are no comments on this title.

to post a comment.
Share