Elementary Algorithms
by Larry LIU Xinyu
Publisher: Github 2016
Number of pages: 622
Description:
'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.
Download or read it online for free here:
Download link
(5.8MB, PDF)
Similar books

by 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.
(4606 views)

by Wojciech Szpankowski - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
(6767 views)

by 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.
(10987 views)

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.
(9172 views)