MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02149nam a2200253Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520100712.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780132847377 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 76.73.C153 .W45 2014 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Weiss, Mark Allen. |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Data structures and algorithm analysis in C++ / |
| Statement of responsibility, etc. |
Mark Allen Weiss |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
FOURTH EDITION. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Harlow, Essex, England : |
| Name of publisher, distributor, etc. |
Pearson Education Limited, |
| Date of publication, distribution, etc. |
c2014 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
vii, 653 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm. |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD118.99 |
| 500 ## - GENERAL NOTE |
|---|
| General note |
"Authorized adaptation from the United States edition, entitled Data structures and Algorithm Analysis in C++, Fourth Edition, ISBN 9780132847377, by Mark Allen Weiss, published by Pearson Education ©2014"--Title page verso. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Chapter 1: Programming: A General Overview -- Chapter 2: Algorithm Analysis -- Chapter 3: Lists, Stacks, and Queues -- Chapter 4: Trees -- Chapter 5: Hashing -- Chapter 6: Priority Queues (Heaps) -- Chapter 7: Sorting -- Chapter 8: The Disjoint Sets Class -- Chapter 9: Graph Algorithms -- Chapter 10: Algorithm Design Techniques -- Chapter 11: Amortized Analysis -- Chapter 12: Advanced Data Structures and Implementation -- Appendix A: Separate Compilation of Class Templates. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
C++ (COMPUTER PROGRAM LANGUAGE) |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
