# Practical Analysis of Algorithms

• Provides highly detailed yet easy to understand explanations and proofs

• Presents numerous practical examples throughout the text

• Introduces the fundamental mathematics required, described from the point of view of a programmer

Textbook

Part of the Undergraduate Topics in Computer Science book series (UTICS)

1. Front Matter
Pages i-xii
2. Dana Vrajitoru, William Knight
Pages 1-7
3. Dana Vrajitoru, William Knight
Pages 9-62
4. Dana Vrajitoru, William Knight
Pages 63-94
5. Dana Vrajitoru, William Knight
Pages 95-167
6. Dana Vrajitoru, William Knight
Pages 169-293
7. Dana Vrajitoru, William Knight
Pages 295-360
8. Dana Vrajitoru, William Knight
Pages 361-452
9. Dana Vrajitoru, William Knight
Pages 453-462
10. Back Matter
Pages 463-466

### Introduction

Analysis of algorithms plays an essential role in the education and training of any serious programmer preparing to deal with real world applications.

Practical Analysis of Algorithms 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. Throughout the text, the explanations are aimed at the level of understanding of a typical upper-level student, and are accompanied by detailed examples and classroom-tested exercises.

Topics and 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, a very important tool used in the analysis of algorithms
• 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

This clearly-structured and easy-to-read textbook/reference applies a unique, practical approach suitable for professional short courses and tutorials, as well as for students of computer science.

Dr. Dana Vrajitoru is an Associate Professor of Computer Science at Indiana University South Bend, IN, USA. Dr. William Knight is an Emeritus Associate Professor at the same institution.

### Keywords

Algorithms Analysis Fundamental Notation Probabilistic Algorithms Recurrence Relations

#### Authors and affiliations

1. 1.Indiana UniversitySouth BendUSA
2. 2.Indiana UniversitySouth BendUSA

Dr. Dana Vrajitoru is an Associate Professor of Computer Science at Indiana University South Bend, IN, USA. Dr. William Knight is an Emeritus Associate Professor at the same institution.

### Bibliographic information

• Book Title Practical Analysis of Algorithms
• Authors Dana Vrajitoru
William Knight
• Series Title Undergraduate Topics in Computer Science
• Series Abbreviated Title Undergraduate Topics Computer Sci.
• DOI https://doi.org/10.1007/978-3-319-09888-3
• Copyright Information Springer International Publishing Switzerland 2014
• Publisher Name Springer, Cham
• eBook Packages Computer Science Computer Science (R0)
• Softcover ISBN 978-3-319-09887-6
• eBook ISBN 978-3-319-09888-3
• Series ISSN 1863-7310
• Series E-ISSN 2197-1781
• Edition Number 1
• Number of Pages XII, 466
• Number of Illustrations 245 b/w illustrations, 0 illustrations in colour
• Topics
• Buy this book on publisher's site
Industry Sectors
Materials & Steel
Automotive
Biotechnology
IT & Software
Telecommunications
Consumer Packaged Goods