An introduction to the analysis of algorithms

An introduction to the analysis of algorithms / Michael Soltys.

A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mat...

Full description

Saved in:
Bibliographic Details
Main Author: Soltys, Michael, 1971-
Format: eBook
Language:English
Published: Singapore ; Hackensack, NJ : World Scientific Publishing Co., ©2012.
Edition:2nd ed.
Subjects:
Algorithms > Textbooks.
MATHEMATICS > Numerical Analysis.
Algorithms
Textbooks
Online Access:Click for online access
Table of Contents:
  • 1. Preliminaries. 1.1. Induction. 1.2. Invariance. 1.3. Correctness of algorithms. 1.4. Stable marriage. 1.5. Answers to selected problems. 1.6. Notes
  • 2. Greedy algorithms. 2.1. Minimum cost spanning trees. 2.2. Jobs with deadlines and profits. 2.3. Further examples and problems. 2.4. Answers to selected problems. 2.5. Notes
  • 3. Divide and conquer. 3.1. Mergesort. 3.2. Multiplying numbers in binary. 3.3. Savitch's algorithm. 3.4. Further examples and exercises. 3.5. Answers to selected problems. 3.6. Notes
  • 4. Dynamic programming. 4.1. Longest monotone subsequence problem. 4.2. All pairs shortest path problem. 4.3. Simple knapsack problem. 4.4. Activity selection problem. 4.5. Jobs with deadlines, durations and profits. 4.6. Further examples and problems. 4.7. Answers to selected problems. 4.8. Notes
  • 5. Online algorithms. 5.1. List accessing problem. 5.2. Paging. 5.3. Answers to selected problems. 5.4. Notes
  • 6. Randomized algorithms. 6.1. Perfect matching. 6.2. Pattern matching. 6.3. Primality testing. 6.4. Public key cryptography. 6.5. Further exercises. 6.6. Answers to selected problems. 6.7. Notes.

Similar Items