Logo

Introduction to Design Analysis of Algorithms

Small book cover: Introduction to Design Analysis of Algorithms

Introduction to Design Analysis of Algorithms
by

Publisher: Smashwords
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.

Home page url

Download or read it online for free here:
Download link
(4.4MB, PDF)

Similar books

Book cover: Algorithms: Fundamental TechniquesAlgorithms: Fundamental Techniques
by - 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.
(17533 views)
Book cover: Efficient Algorithms for Sorting and SynchronizationEfficient Algorithms for Sorting and Synchronization
by - samba.org
This thesis presents efficient algorithms for parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on efficient but incorrect algorithms followed by a cleanup phase that completes the sort.
(14064 views)
Book cover: Vector Models for Data-Parallel ComputingVector Models for Data-Parallel Computing
by - The MIT Press
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.
(12936 views)
Book cover: Design and Analysis of Computer AlgorithmsDesign and Analysis of Computer Algorithms
by - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
(19224 views)