Algorithms: Fundamental Techniques
by Macneil Shonle, Matthew Wilson, Martin Krischik
Publisher: Wikibooks 2006
Number of pages: 68
Description:
This book aims to be an accessible introduction into the design and analysis of efficient algorithms. Throughout the book, we will explain only the most basic techniques, and we will give intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
Download or read it online for free here:
Download link
(1.2MB, PDF)
Similar books
Planning Algorithmsby 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.
(20424 views)
Design and Analysis of Computer Algorithmsby David M. Mount - 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.
(18336 views)
Algorithms and Data Structures for External Memoryby Jeffrey Scott Vitter - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
(11690 views)
LEDA: A Platform for Combinatorial and Geometric Computingby K. Mehlhorn, St. Näher - Cambridge University Press
The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.
(9740 views)