Practical Analysis of Algorithms (Paperback, 2014 ed.)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Undergraduate Topics in Computer Science
Release date:	September 2014
First published:	2014
Authors:	Dana Vrajitoru • William Knight
Dimensions:	235 x 155 x 26mm (L x W x T)
Format:	Paperback
Pages:	466
Edition:	2014 ed.
ISBN-13:	978-3-319-09887-6
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures
LSN:	3-319-09887-X
Barcode:	9783319098876

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!