Algorithmics: Theory & Practice – G. Brassard, P. Bratley – 1st Edition

For departments of computer science offering Sophomore through Junior-level courses in Algorithms or and Analysis of Algorithms.

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

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 , and an introduction to parallel algorithms, both of which are becoming increasingly important. Approaches the of algorithms by type rather than by application.

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 .
13. Heuristic and Approximate Algorithms.

Title: Algorithmics: Theory & Practice
Author: Gilles Brassard / Paul Bratley
Edition: 1st Edition
ISBN: 0130232432 | 978-0130232434
Type: eBook
Language: English

No Comments

  • Can you please leave feedback and comments here

    Your opinions and comments would be greatly appreciated. If you have comments or questions we've added this section so that we might have a dialogue with you.

Complete all fields

8 − 5 =