This release contains the new edition with 119 exercises/answers (both in English and Chinese). The book is fully rewrote from 2020 to 2023. Below are some major changes compare with the 1st edition:

1. Make functional list (singly-linked) the first chapter, as it's the basic bricks for almost all functional data structures and algorithms; Removed the chapter about suffix-tree; added appendix about the deletion algorithms for red-black tree and AVL tree.
2. Consolidate all example programs into two unified languages: Haskell for functional, and Bourbaki (a virtual language) for imperative;
3. Unified notations for algorithm definition; Simplified the explanation for all algorithms; Improved some implementation with fusion through concatMap (aka. flatMap). Fixed errors found in the 1st edition;
4. Provided answers to 119 exercises;
5. Removed the dependency to dot (graphviz) and imagemagic, upgraded the build system to lualatex.

Cheers.

Xinyu LIU Sep 1st/2023

Download

• English
• 中文

This release contains the fixings collected till 2020/10.

Main changes in this release:

Re-write the Trie and Prefix Tree chapter for all branches. Released a intermediate pdf contains Scala and Java example code for the first 5 chapters.

Main changes in this release (English edition):

• The formal proof of functional AVL tree insertion algorithm is moved to Appendix C;
• Added functional AVL tree deletion algorithm in Chapter 4;
• Added imperative AVL tree deletion algorithm in Appendix C.

Add a new appendix about the imperative red-black tree deletion algorithm.

Fixed the error in red-black tree deletion algorithm. There are two pdf files released:

• elementary-algorithms.pdf This is the pdf for the whole book in English;
• rbtree-zh-cn.pdf This is the updated red-black tree chapter in Chinese.

Corrected mistakes in editorial work

Updated the appendix

• elementary-algorithms.pdf

Updated chapter of search

• elementary-algorithms.pdf

0.618030 version includes:

Main book: elementary-algorithms.pdf

Update the chapter of quick sort and merge sort.