Practical algorithms in C++
著者
書誌事項
Practical algorithms in C++
（Coriolis group book）
Wiley, c1995
- : pbk
大学図書館所蔵 件 / 全7件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 433-435) and index
内容説明・目次
内容説明
A practical guide to implementing algorithms in C++. Have you been looking for a C++ book that not only talks about some of the most popular algorithms of today, but also implements them? Then look no further. This book presents algorithms from a practical point of view, clearly explaining how the algorithms work, as well as fully implementing them in C++. Written to the intermediate C++ programmer, this book covers a wide range of subjects, from sorting and searching algorithms, to graph traversal algorithms, hashing algorithms, priority queues, finite state machines, and "algorithmic generators," a unique, object-oriented way of implementing algorithms. Includes theory and practice, with emphasis on practice. Builds from the basics to the most advanced techniques. Backs each algorithm with full source code provided on disk-no misleading code fragments. Includes high quality code, written specifically for C++, and not simply ported from some other language. All code fully tested in Borland and Microsoft versions of C++.
目次
Basic Concepts. Algorithm Construction in C++. Algorithmic Generators. Primes, Factors, and Permutations. Linear Congruential Generators. Random Combinations and Permutations. Hashing Algorithms. Heaps. Basic Sorting Algorithms. More Sorting Algorithms. Text Searching. Shift-OR Text Searching. Graph Data Structures. Basic Graph Traversals. Graph Minimization Algorithms. Finite State Machines. Bibliography. Index.
「Nielsen BookData」 より