TY  - BOOK
AU  - Van Wyk, Christopher J.
TI  - Data structures and C programs
SN  - 201539853
AV  - QA 76.73.C15 .V36 1990 
PY  - 1990///
CY  - Reading, Massachusetts
PB  - Addision-Wesley Publishing Company
KW  - C (COMPUTER PROGRAM LANGUAGE)
N1  - Includes bibliographical references and index; 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
N2  - 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"
ER  -