Programs and data structures in C : based on ANSI C and C[++]
著者
書誌事項
Programs and data structures in C : based on ANSI C and C[++]
（Wiley professional computing）
Wiley, c1992
2nd ed
- : disk
大学図書館所蔵 件 / 全10件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 269) and index
内容説明・目次
- 巻冊次
-
ISBN 9780471931232
内容説明
Programs and Data Structures in C Based on ANSI C and C++ Second Edition Leendert Ammeraal Hogeschool Utrecht, The Netherlands Reviews of the first edition: Because this book explains a lot of simple tricks and useful techniques to speed up common programming tasks it is a useful addition to conventional textbooks dealing with more theoretical aspects of programming.' Journal of New Generation Computer Systems The book is especially suitable for advanced programmers who need searching and sorting methods. But it is also a help for the newcomer.' Journal of Information Processing & Cybernetics This book is designed to help you develop and reinforce your programming skills either for self-study or alongside a course text. All programs and exercises conform to the new ANSI C Standard, are accessible for those using either a C or C++ compiler, and are machine independent. The author shows how to use advanced programming techniques, including dynamic data structures, and the emphasis throughout is on how to achieve correctness and efficiency. There is a particular focus on the storage and retrieval of large amounts of data using data structures such as AVL trees and B-trees.
Other useful algorithms discussed include those for the generation of permutations, dynamic programming, the criticalpath method, and the evaluation of arithmetic expressions. For the experienced programmer converting to C (or C++), or the beginning student, the wealth of programs, exercises and hints provided here will help increase your programming speed and efficiency.
目次
Programming Style, Iteration and Recursion. Array and File Manipulation. Some Combinatorial Algorithms. Linked Lists. Binary Trees. B-Trees. Tries. Graphs. Fundamentals of Interpreters and Compilers. Appendices. Bibliography. Index.
- 巻冊次
-
: disk ISBN 9780471931249
内容説明
The author provides a discussion of algorithms and data structures, using the C language. The text avoids any algorithmic vagueness by presenting complete programs in which the student can insert his or her own output statements to see what the algorithm does. In the second edition all programs have been rewritten in ANSI C, in such a way that they also conform to C++ language rules. This is possible by using only those language elements that are available both in ANSI C and in C++. An important new subject is AVL trees (including node deletion). Besides a recursive function to generate a complete list of permutations, there is also an iterative function, "nextperm", to generate only the next permutation. The same also applies to combinations, for which there is a function, "nextcomb". The program BTREE.C now displays a representation of the complete B-tree each time it is updated. Finally, more use is made of standard library functions. For example, there is a discussion of the standard library function "qsort" and how this relates to quicksort functions used in the programs.
「Nielsen BookData」 より