Stop Updating 停止更新
通过动手实现这些数据结构和在简书上写博文，我学会了很多东西。但是目前的实现太“脏”——没有模板化，缺少统一的接口和测试方法，目录结构也不合理，把东西粗糙地做出来就满足是不行的。
短时间内我不会把精力放回算法。但是预计春假开始，要用干净的C++11，实现一套模板化、header only、真正可以用的轮子。暂定名字是blóm，取自冰岛语中的「花」。到时面试中侥幸逃过的图论算法，也要更深入才行。
It's a long way forward, so trust in me.
written on 2017/02/21
Data Structures and Algorithms for Fun 请问您今天要来点算法吗？
- Skip List
wiki: https://en.wikipedia.org/wiki/Skip_list
completed on 2016/02/07 - Bloom Filter
wiki: https://en.wikipedia.org/wiki/Bloom_filter
completed on 2016/03/01 - Union Find Set
wiki: https://en.wikipedia.org/wiki/Disjoint-set_data_structure
completed on 2016/04/30 - Trie
wiki: https://en.wikipedia.org/wiki/Trie
completed on 2016/07/21 - Memory Pool
wiki: https://en.wikipedia.org/wiki/Memory_pool
completed on 2016/08/17 - Reservoir Sampling
wiki: https://en.wikipedia.org/wiki/Reservoir_sampling
completed on 2016/11/13 - AVL Tree
wiki: https://en.wikipedia.org/wiki/AVL_tree
completed on 2016/12/10 - XOR Linked List
wiki: https://en.wikipedia.org/wiki/XOR_linked_list
completed on 2016/12/11 - Ternary Search Tree
wiki: https://en.wikipedia.org/wiki/Ternary_search_tree
completed on 2016/12/12 - Fenwick Tree/Binary Indexed Tree
wiki: https://en.wikipedia.org/wiki/Fenwick_tree
completed on 2017/01/29