for data structure recap
- 9 basic sort algorithm (inner sort)
- insert sort (insert sort with binary search)
- shell sort
- bubble sort (bidirectional bubble sort)
- quick sort (with iterative version)
- select sort
- heap sort
- merge sort (with iterative version)
- radix sort (only support unsigned integer)
- bucket sort
- advanced sort algorithm (outer sort)
- multi-way merge sort with loser tree and replacement substite algorithm
- benchmark
- stability test
- near sorted performance test (demostrate quick sort's drawback)
-
binary tree / general tree
- recursive traversal
- iterative traversal
- morris traversal
-
tree set (all test with std::set)
- binary search tree
- AVL tree
- Red Black tree
- 23 tree
- B-tree
- B+tree
- dfs / bfs traversal
- topological sort