Ship-Ship-Hooray! Free Shipping on $25+ Details >
Fundamentals of Algorithmics

Fundamentals of Algorithmics - 96 edition

Fundamentals of Algorithmics - 96 edition

ISBN13: 9780133350685

ISBN10: 0133350681

Fundamentals of Algorithmics by Gilles Brassard - ISBN 9780133350685
Cover type: Hardback
Edition: 96
Copyright: 1996
Publisher: Prentice Hall, Inc.
Published: 1996
International: No
Fundamentals of Algorithmics by Gilles Brassard - ISBN 9780133350685

ISBN13: 9780133350685

ISBN10: 0133350681

Cover type: Hardback
Edition: 96

List price: $205.25

All of our used books are 100% hand-inspected and guaranteed! Happy you, happy us.

Ships directly from us
You Save $102.65 (50%)

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.


This is an introductory-level algorithm text. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application.

Structures material by techniques employed, not by the application area, so students can progress from the underlying abstract concepts to the concrete application essentials.

Begins with a compact, but complete introduction to some necessary math, and also includes a long introduction to proofs by contradiction and mathematical induction. This serves to fill the gaps that many undergraduates have in their mathematical knowledge.

Gives a paced, thorough introduction to the analysis of algorithms, and uses coherent notation and unusually detailed treatment of solving recurrences.

Includes a chapter on probabilistic algorithms, and an introduction to parallel algorithms, both of which are becoming increasingly important.

Approaches the analysis and design of algorithms by type rather than by application.

Table of Contents

Table of Contents

1. Preliminaries.

2. Elementary Algorithmicss.

3. Asymptotic Notation.

4. Analysis of Algorithms.

5. Some Data Structures.

6. Greedy Algorithms.

7. Divide-And-Conquer.

8. Dynamic Programming.

9. Exploring Graphs.

10. Probabilistic Algorithms.

11. Parallel Algorithms.

12. Computational Complexity.

13. Heuristic and Approximate Algorithms.


Top Arrow