TY  - BOOK
AU  - FLAMIG,Bryan
TI  - Practical algorithms in C++
SN  - 0471009555
U1  - 005.133 
PY  - 1995///
CY  - N.Y
PB  - John Wiley
KW  - C++ (Computer program language)
KW  - Computer algorithms
N1  - Preface. - Ch. 1. Basic Concepts. - Ch. 2. Algorithm Construction in C++. - Ch. 3. Algorithmic Generators. -  Ch. 4. Primes, Factors, and Permutations. - Ch. 5. Linear Congruential Generators. - Ch. 6. Random Combinations and Permutations. - Ch. 7. Hashing Algorithms. - Ch. 8. Heaps. - Ch. 9. Basic Sorting Algorithms. - Ch. 10. More Sorting Algorithms. - Ch. 11. Text Searching. - Ch. 12. Shift-OR Text Searching. - Ch. 13. Graph Data Structures. - Ch. 14. Basic Graph Traversals. - Ch. 15. Graph Minimization Algorithms. - Ch. 16. Finite State Machines. - Bibliography. - Index; Accompanied by : 1 computer disk (3 1/2 in.)
N2  - 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, piority queues, finite state machines, and "algorithmic generators," a unique, object-oriented way of implementing algorithms. - Back cover
ER  -