A free book about elementary algorithms and data structuresIntroduction Binary Search Tree Red Black Tree AVL Tree Trie and Patricia (Need re-write) Suffix Tree (Need re-write) B-Tree (Need re-write) Queue (I am working on this) Array and List* Elementary Sort* * : These topics are planned. For queue, it will cover how to realize O(1) time queue with list or array; For array and list, I'll review how to implement O(lg N) time random access array by list. This is a typical approach in purely functional setting. For elementary sort algorithms, I'll go through insertion sort, merge sort, quick sort etc algorithms in both purely functional way and imperative way. For elementary search algorithm, I planned to cover n-selection problem, binary search and some string matching algorithms such as KMP. |