ENGLISH

Practical Analysis of Algorithms

By Dana Vrajitoru , William Knight (auth.)

Book information

Publisher
Springer International Publishing
Year
2014
ISBN
978-3-319-09887-6, 978-3-319-09888-3
DOI
10.1007/978-3-319-09888-3
Language
english
Format
PDF
Filesize
11 MB (11529076 bytes)
Series
Undergraduate Topics in Computer Science
Edition
1
Pages
466\475
Time added
2014-11-10 20:00:00
Algorithm Analysis and Problem Complexity; Logics

Description

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.

Similar books