Book Description
This book introduces about elementary algorithms and data structure. It includes side-by-side comparison about purely functional realization and their imperative counterpart.
This open book is licensed under a Open Publication License (OPL). You can download Elementary Algorithms ebook for free in PDF format (7.4 MB).
Table of Contents
Chapter 1
Binary Search Tree, the 'hello world' data structure
Chapter 2
The evolution of insertion sort
Chapter 3
Red-black tree, not so complex as it was thought
Chapter 4
AVL tree
Chapter 5
Radix tree, Trie and Prefix Tree
Chapter 6
B-Trees
Chapter 7
Binary Heaps
Chapter 8
From grape to the world cup, the evolution of selection sort
Chapter 9
Binomial heap, Fibonacci heap, and pairing heap
Chapter 10
Queue, not so simple as it was thought
Chapter 11
Sequences, The last brick
Chapter 12
Divide and conquer, Quick sort vs. Merge sort
Chapter 13
Searching