Practical Analysis of Algorithms

丛 书 名：Undergraduate Topics in Computer Science

版本说明：1

作     者：Dana Vrajitoru, William Knight (auth.) 

I S B N：(纸本) 9783319098876;9783319098883 

出 版 社：Springer International Publishing 

出 版 年：2014年

页      数：475页

摘      要：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.