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

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

(

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

(

**9190**views)

**Algorithms and Data Structures: The Basic Toolbox**

by

**K. Mehlhorn, P. Sanders**-

**Springer**

This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, etc.

(

**7486**views)

**Algorithms and Complexity**

by

**Herbert S. Wilf**-

**AK Peters, Ltd.**

An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.

(

**13252**views)