MARC details
| 000 -LEADER |
|---|
| fixed length control field |
01460nam a2200217Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520094852.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 |
9780201455731 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 76.73.C15 .W45 1993 |
| 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. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Redwood City, California : |
| Name of publisher, distributor, etc. |
The Benjamin/Cummings Publishing Company, Inc., |
| Date of publication, distribution, etc. |
c1993 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xvii, 455 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
21 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Introduction -- Algorithm analysis -- Lists, stacks, and queues -- Trees -- Hashing -- Priority queues (heaps) -- Sorting -- The disjoint set ADT -- Graph algorithms -- Algorithm design techniques -- Amortized analysis. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
This text takes a modern approach to algorithms and data structures. Emphasizing theory rather than code, it highlights conceptual topics with a focus on ADTs and analysis of algorithms for efficiency. In particular, the concentration is on specific programming problems and how careful implementation will improve program running time. Logically organized, it presents topics in a manageable order. Designed for students and professionals, it is suitable for an advanced data structures course or a first-year graduate course in algorithm analysis. |
| 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 |
