000			01933nam a2200217Ia 4500
003			NULRC
005			20250520094857.0
008			250520s9999 xx 000 0 und d
020			_a201539853
040			_cNULRC
050			_aQA 76.73.C15 .V36 1990
100			_aVan Wyk, Christopher J. _eauthor
245		0	_aData structures and C programs / _cChristopher J. Van Wyk.
260			_aReading, Massachusetts : _bAddision-Wesley Publishing Company, _cc1990
300			_ax, 387 pages : _billustrations ; _c24 cm
504			_aIncludes bibliographical references and index.
505			_aPREFACE 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			_aI 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			_aC (COMPUTER PROGRAM LANGUAGE)
942			_2lcc _cBK
999			_c5092 _d5092