You might also like

More about Practical Analysis of Algorithms

• Book details
• Synopsis
• Trending among others

You get 110 loyalty points

Book synopsis

This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book.

Book details

Book category Books in English Mathematics & science Mathematics Calculus & mathematical analysis

• Full title: Practical Analysis of Algorithms
• Author: Dana Vrajitoru, William Knight
• Language: English
• Binding: Paperback
• Number of pages: 466
• EAN: 9783319098876
• ISBN: 331909887X
• ID: 05147751
• Publisher: Springer International Publishing AG
• Weight: 718 g
• Dimensions: 233 × 157 × 26 mm
• Date of publishing: 04. September 2014

Trending among others

---

---

---