Introduction to Design Analysis of Algorithms
by K. Raghava Rao
Publisher: Smashwords 2013
Number of pages: 142
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.
Home page url
Download or read it online for free here:
by Donald E. Knuth - Addison-Wesley Professional
This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.
by Niklaus Wirth - Prentice Hall
The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.
by Nashat Mansour - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
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.