Practical Algorithms in C++
Bryan Flamig(Author)
Wiley (Publisher)
Published on 2. March 1995
Book
Mixed media product
464 pages
978-0-471-00955-9 (ISBN)
Description
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++.
More details
Series
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
Professional and scholarly
Illustrations
Illustrations
Dimensions
Height: 233 mm
Width: 189 mm
Weight
794 gr
ISBN-13
978-0-471-00955-9 (9780471009559)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Person
BRYAN FLAMIG is a software developer, consultant, and author of several successful computer titles, including Practical Data Structures in C++ and Turbo C++: Step-by-Step.
Content
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.