**Algorithms and Complexity**

by Herbert S. Wilf

**Publisher**: AK Peters, Ltd. 1994**ISBN/ASIN**: 1568811780**ISBN-13**: 9781568811789**Number of pages**: 139

**Description**:

This is an introductory textbook, suitable for classroom use, on the design and analysis of algorithms, complexity, methods for solving problems on computers and the costs (usually in running time) of using those methods.

Download or read it online for free here:

**Download link**

(0.8MB, PDF)

## Similar books

**Open Data Structures: An Introduction**

by

**Pat Morin**-

**AU Press**

Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

(

**10362**views)

**Algorithms**

by

**Ian Craw, John Pulham**-

**University of Aberdeen**

This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.

(

**10513**views)

**Design and Analysis of Algorithms**

by

**Herbert Edelsbrunner**-

**Duke University**

The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.

(

**13126**views)

**Algorithms and Data Structures: With Applications to Graphics and Geometry**

by

**Jurg Nievergelt, Klaus Hinrichs**-

**Prentice Hall**

Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.

(

**3652**views)