ISBN-10:
0471963550
ISBN-13:
9780471963554
Pub. Date:
08/14/1996
Publisher:
Wiley
Algorithms and Data Structures in C++ / Edition 1

Algorithms and Data Structures in C++ / Edition 1

by Leen Ammeraal, L. Ammeraal

Paperback

Current price is , Original price is $97.75. You
Select a Purchase Option
  • purchase options
    $85.37 $97.75 Save 13% Current price is $85.37, Original price is $97.75. You Save 13%.
  • purchase options

Overview

Algorithms and Data Structures in C++ / Edition 1

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.

Product Details

ISBN-13: 9780471963554
Publisher: Wiley
Publication date: 08/14/1996
Pages: 368
Product dimensions: 0.75(w) x 9.25(h) x 7.50(d)

Table of Contents

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.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews