**Design and Analysis of Computer Algorithms**

by David M. Mount

**Publisher**: University of Maryland 2003**Number of pages**: 135

**Description**:

Programming is a very complex task, and there are a number of aspects of programming that make it so complex. The first is that most programming projects are very large, requiring the coordinated efforts of many people. (This is the topic a course like software engineering.) The next is that many programming projects involve storing and accessing large quantities of data efficiently. (This is the topic of courses on data structures and databases.) The last is that many programming projects involve solving complex computational problems, for which simplistic or naive solutions may not be efficient enough. The complex problems may involve numerical data (the subject of courses on numerical analysis), but often they involve discrete data. This is where the topic of algorithm design and analysis is important.

Download or read it online for free here:

**Download link**

(0.8MB, PDF)

## Similar books

**Elementary Algorithms**

by

**Larry LIU Xinyu**-

**Github**

'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.

(

**7055**views)

**A=B**

by

**Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger**-

**AK Peters, Ltd.**

The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.

(

**24627**views)

**Introduction to Design Analysis of Algorithms**

by

**K. Raghava Rao**-

**Smashwords**

This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.

(

**10781**views)

**Vector Models for Data-Parallel Computing**

by

**Guy Blelloch**-

**The MIT Press**

Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.

(

**10591**views)