**Introduction to Design Analysis of Algorithms**

by K. Raghava Rao

**Publisher**: Smashwords 2013**ISBN-13**: 9781301558018**Number of pages**: 142

**Description**:

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

Download or read it online for free here:

**Download link**

(4.4MB, PDF)

## Similar books

**Modern Computer Arithmetic**

by

**Richard P. Brent, Paul Zimmermann**-

**LORIA**

This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.

(

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

(

**1639**views)

**Tabu Search**

by

**Wassim Jaziri**-

**InTech**

Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.

(

**8633**views)

**Planning Algorithms**

by

**Steven M. LaValle**-

**Cambridge University Press**

Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this book tightly integrates a vast body of literature from several fields into a coherent source for reference in applications.

(

**11925**views)