Algorithms and data structures in C++
著者
書誌事項
Algorithms and data structures in C++
Wiley, 1996
大学図書館所蔵 件 / 全19件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
algorithms and data structures in C++ Leendert Ammeraal Hogeschool van Utrecht, The Netherlands C++ is capable of tackling a whole range of programming tasks. The purpose of this book is to give breadth and depth to C++ programmers' existing experience of the language by representing a large number of algorithms, most of them implemented as ready-to-run (and standalone) programs. The programs are as readable as possible without sacrificing too great a degree of efficiency, generality, portability and robustness. Both the classes and programs are designed to demonstrate major programming principles. There is coverage of two key language features - templates and exception handling - apart from which the reader is assumed to have working knowledge of C++. Besides traditional subjects, such as quicksort and binary trees, this book also covers some less well-known topics, including multi-precision arithmetic, route planning and external sorting. Demonstration programs for these and many other exciting applications are based on C++ classes which you can also use in programs of your own.
目次
Some Aspects of Programming in C++.
Arithmetic.
Sorting Arrays and Files.
Stacks, Queues and Lists.
Searching and String Processing.
Binary Trees.
B-trees.
Tries, Priority Queues and File Compression.
Graphs.
Some Combinatorial Algorithms.
Fundamentals of Interpreters and Compilers.
Appendix.
Bibliography.
Index.
「Nielsen BookData」 より