**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

**Problem Solving with Algorithms and Data Structures Using Python**

by

**Brad Miller, David Ranum**-

**Franklin, Beedle & Associates**

This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.

(

**5059**views)

**Computational Geometry: Methods and Applications**

by

**Jianer Chen**

The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.

(

**10467**views)

**Notes on Data Structures and Programming Techniques**

by

**James Aspnes**-

**Yale University**

Topics include programming in C; data structures (arrays, stacks, queues, lists, trees, heaps, graphs); sorting and searching; storage allocation and management; data abstraction; programming style; testing and debugging; writing efficient programs.

(

**1523**views)

**Algorithms: Fundamental Techniques**

by

**Macneil Shonle, Matthew Wilson, Martin Krischik**-

**Wikibooks**

An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.

(

**10693**views)