MARC details
| 000 -LEADER |
|---|
| fixed length control field |
01933nam a2200217Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520094857.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 |
201539853 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 76.73.C15 .V36 1990 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Van Wyk, Christopher J. |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Data structures and C programs / |
| Statement of responsibility, etc. |
Christopher J. Van Wyk. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Reading, Massachusetts : |
| Name of publisher, distributor, etc. |
Addision-Wesley Publishing Company, |
| Date of publication, distribution, etc. |
c1990 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
x, 387 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
PREFACE iii Part I: Fundamental Ideas 1 Charting Our Course 1.1 PROBLEM: SUMMARIZING DATA 3 1.2 SOLUTION I 5 1.3 SOLUTION II 7 1.4 MEASURING PERFORMANCE 12 1.5 SUMMARY AND PERSPECTIVE 20 The Complexity of Algorithms 25 2.1 THE IDEA OF AN ALGORITHM 25 2.2 ALGORITHMS FOR EXPONENTIATION 27 2.3 ASYMPTOTIC ANALYSIS 35 2.4 IMPLEMENTION CONSIDERATIONS 38 2.5 SUMMARY AND PERSPECTIVE 41 Pointers and Dynamic Storage 49 3.1 VARIABLES AND POINTERS 49 3.2 CHARACTER STRINGS AND ARRAYS 56 3.3 TYPEDEFS AND STRUCTURES 66 3.4 DYNAMIC STORAGE ALLOCATION 69 3.5 SUMMARY AND PERSPECTIVE 72 vii |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
I found this book valuable to understand advanced, necessary, concepts in C: pointers, stacks and queues, memory organization, search algorithms, hashing, sorting trees, priority queues, and other basic advanced topics. In each topic, the book also goes into performance analysis, using O-notation. The book also uses pseudocode to help understand the algorithms, without the drawbacks of actual code. However, what I found bizarre about this book is that the first chapters (of basic concepts) had code examples, while the latter ones did not! Surely, a well-commented example of a red-black tree program would be the last step in teaching it. Especially in a book about "C programs". |
| 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 |
