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
![Book cover: The Design of Approximation Algorithms](images/5141.jpg)
by D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(16269 views)
![Book cover: Efficient Algorithms for Sorting and Synchronization](images/3732.jpg)
by Andrew Tridgell - 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.
(13617 views)
![Book cover: Randomized Algorithms](images/6716.jpg)
by Wolfgang Merkle - ESSLLI
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.
(11745 views)
![Book cover: Data Structures and Algorithms](images/11597.jpg)
by Catherine Leung - GitBook
This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.
(12300 views)