|
26 | 26 |
|
27 | 27 | ####已实现 ( Implemented ): |
28 | 28 |
|
29 | | - Array shuffle |
30 | | - Prime test(trial division) |
31 | | - Prime test(Miller-Rabin's method) |
32 | | - 2D Array |
33 | | - Arbitrary Integer |
34 | | - Linear congruential generator |
35 | | - Maximum subarray problem |
36 | | - |
37 | | - Bit-Set |
38 | | - Queue |
39 | | - Stack |
40 | | - Binary Heap |
41 | | - Fibonacci Heap |
42 | | - Priority Queue (list based) |
43 | | - |
44 | | - Bubble sort |
45 | | - Selection sort |
46 | | - Insertion sort |
47 | | - Shell sort |
48 | | - Radix sort |
49 | | - Quick sort |
50 | | - Merge sort |
51 | | - Double linked list |
52 | | - Skip list |
53 | | - Self-organized linked-list ops (move-to-front, move-ahead-one) |
54 | | - Largest common sequence |
55 | | - |
56 | | - Binary search tree |
57 | | - AVL tree |
58 | | - Dynamic order statistics |
59 | | - Red-black tree |
60 | | - Interval tree |
61 | | - Prefix Tree(Trie) |
62 | | - Suffix Tree |
63 | | - B-Tree |
64 | | - Suffix Array |
65 | | - |
66 | | - Hash by multiplication |
67 | | - Hash table |
68 | | - Universal hash function |
69 | | - Perfect hash |
70 | | - Java's string hash |
71 | | - FNV-1a string hash |
72 | | - SimHash |
73 | | - Bloom Filter |
74 | | - SHA-1 Message Digest Algorithm |
75 | | - MD5 |
76 | | - Base64 |
77 | | - |
78 | | - Graph data structure |
79 | | - Strongly Connected Components(SCC) |
80 | | - Prim's minimum spanning tree |
81 | | - Kruskal MST |
82 | | - Directed/Undirected graph ops |
83 | | - Breadth First Search |
84 | | - Depth First Search |
85 | | - Dijkstra's algorithm |
86 | | - Bellman-Ford algorithm |
87 | | - Edmonds-Karp Maximal Flow |
88 | | - Push–Relabel algorithm |
89 | | - |
90 | | - Huffman Coding |
91 | | - Word segementation(CHN/GB18030) using HMM and viterbi algorithm. |
92 | | - A* algorithm |
93 | | - K-Means |
94 | | - Knuth–Morris–Pratt algorithm |
95 | | - Disjoint-Set |
96 | | - 8-Queue Problem |
97 | | - Palindrome |
| 29 | +| Name | File | |
| 30 | +|------|------| |
| 31 | +|Array shuffle|https://github.com/xtaci/algorithms/blob/master/include/shuffle.h | |
| 32 | +|Prime test(trial division)|https://github.com/xtaci/algorithms/blob/master/include/prime.h| |
| 33 | +|Prime test(Miller-Rabin's method)|https://github.com/xtaci/algorithms/blob/master/include/prime.h| |
| 34 | +|2D Array|https://github.com/xtaci/algorithms/blob/master/include/2darray.h| |
| 35 | +|Arbitrary Integer|https://github.com/xtaci/algorithms/blob/master/include/integer.h| |
| 36 | +|Linear congruential generator|https://github.com/xtaci/algorithms/blob/master/include/random.h| |
| 37 | +|Maximum subarray problem|https://github.com/xtaci/algorithms/blob/master/include/max_subarray.h| |
| 38 | +|Bit-Set|https://github.com/xtaci/algorithms/blob/master/include/bitset.h| |
| 39 | +|Queue|https://github.com/xtaci/algorithms/blob/master/include/queue.h| |
| 40 | +|Stack|https://github.com/xtaci/algorithms/blob/master/include/stack.h| |
| 41 | +|Binary Heap|https://github.com/xtaci/algorithms/blob/master/include/heap.h| |
| 42 | +|Fibonacci Heap|https://github.com/xtaci/algorithms/blob/master/include/fib-heap.h| |
| 43 | +|Priority Queue (list based)|https://github.com/xtaci/algorithms/blob/master/include/priority_queue.h| |
| 44 | +|Bubble sort|https://github.com/xtaci/algorithms/blob/master/include/bubble_sort.h| |
| 45 | +|Selection sort|https://github.com/xtaci/algorithms/blob/master/include/selection_sort.h| |
| 46 | +|Insertion sort|https://github.com/xtaci/algorithms/blob/master/include/insertion_sort.h| |
| 47 | +|Shell sort|https://github.com/xtaci/algorithms/blob/master/include/shell_sort.h| |
| 48 | +|Radix sort|https://github.com/xtaci/algorithms/blob/master/include/radix_sort.h| |
| 49 | +|Quicksort|https://github.com/xtaci/algorithms/blob/master/include/quick_sort.h| |
| 50 | +|Merge sort|https://github.com/xtaci/algorithms/blob/master/include/merge_sort.h| |
| 51 | +|Double linked list|https://github.com/xtaci/algorithms/blob/master/include/double_linked_list.h| |
| 52 | +|Skip list|https://github.com/xtaci/algorithms/blob/master/include/skiplist.h| |
| 53 | +|Largest common sequence|https://github.com/xtaci/algorithms/blob/master/include/lcs.h| |
| 54 | +|Binary search tree|https://github.com/xtaci/algorithms/blob/master/include/binary_search_tree.h| |
| 55 | +|AVL tree|https://github.com/xtaci/algorithms/blob/master/include/avl.h| |
| 56 | +|Dynamic order statistics|https://github.com/xtaci/algorithms/blob/master/include/dos_tree.h| |
| 57 | +|Red-black tree|https://github.com/xtaci/algorithms/blob/master/include/rbtree.h| |
| 58 | +|Interval tree|https://github.com/xtaci/algorithms/blob/master/include/interval_tree.h| |
| 59 | +|Prefix Tree(Trie)|https://github.com/xtaci/algorithms/blob/master/include/trie.h| |
| 60 | +|Suffix Tree|https://github.com/xtaci/algorithms/blob/master/include/suffix_tree.h| |
| 61 | +|B-Tree|https://github.com/xtaci/algorithms/blob/master/include/btree.h| |
| 62 | +|Suffix Array|https://github.com/xtaci/algorithms/blob/master/include/suffix_array.h| |
| 63 | +|Hash by multiplication|https://github.com/xtaci/algorithms/blob/master/include/hash_multi.h| |
| 64 | +|Hash table|https://github.com/xtaci/algorithms/blob/master/include/hash_table.h| |
| 65 | +|Universal hash function|https://github.com/xtaci/algorithms/blob/master/include/universal_hash.h| |
| 66 | +|Perfect hash|https://github.com/xtaci/algorithms/blob/master/include/perfect_hash.h| |
| 67 | +|Java's string hash|https://github.com/xtaci/algorithms/blob/master/include/hash_string.h| |
| 68 | +|FNV-1a string hash|https://github.com/xtaci/algorithms/blob/master/include/hash_string.h| |
| 69 | +|SimHash|https://github.com/xtaci/algorithms/blob/master/include/simhash.h| |
| 70 | +|Bloom Filter|https://github.com/xtaci/algorithms/blob/master/include/bloom_filter.h| |
| 71 | +|SHA-1 Message Digest Algorithm|https://github.com/xtaci/algorithms/blob/master/include/sha1.h| |
| 72 | +|MD5|https://github.com/xtaci/algorithms/blob/master/include/md5.h| |
| 73 | +|Base64|https://github.com/xtaci/algorithms/blob/master/include/base64.h| |
| 74 | +|Strongly Connected Components(SCC)|https://github.com/xtaci/algorithms/blob/master/include/scc.h| |
| 75 | +|Prim's minimum spanning tree|https://github.com/xtaci/algorithms/blob/master/include/prim_mst.h| |
| 76 | +|Kruskal MST|https://github.com/xtaci/algorithms/blob/master/include/kruskal_mst.h| |
| 77 | +|Breadth First Search|https://github.com/xtaci/algorithms/blob/master/include/graph_search.h| |
| 78 | +|Depth First Search|https://github.com/xtaci/algorithms/blob/master/include/graph_search.h| |
| 79 | +|Dijkstra's algorithm|https://github.com/xtaci/algorithms/blob/master/include/dijkstra.h| |
| 80 | +|Bellman-Ford algorithm|https://github.com/xtaci/algorithms/blob/master/include/bellman_ford.h| |
| 81 | +|Edmonds-Karp Maximal Flow|https://github.com/xtaci/algorithms/blob/master/include/edmonds_karp.h| |
| 82 | +|Push–Relabel algorithm|https://github.com/xtaci/algorithms/blob/master/include/relabel_to_front.h| |
| 83 | +|Huffman Coding|https://github.com/xtaci/algorithms/blob/master/include/huffman.h| |
| 84 | +|Word segementation|https://github.com/xtaci/algorithms/blob/master/include/word_seg.h| |
| 85 | +|A\* algorithm|https://github.com/xtaci/algorithms/blob/master/include/astar.h| |
| 86 | +|K-Means|https://github.com/xtaci/algorithms/blob/master/include/k-means.h| |
| 87 | +|Knuth–Morris–Pratt algorithm|https://github.com/xtaci/algorithms/blob/master/include/kmp.h| |
| 88 | +|Disjoint-Set|https://github.com/xtaci/algorithms/blob/master/include/disjoint-set.h| |
| 89 | +|8-Queue Problem|https://github.com/xtaci/algorithms/blob/master/include/8queen.h| |
| 90 | +|Palindrome|https://github.com/xtaci/algorithms/blob/master/include/palindrome.h| |
98 | 91 |
|
99 | 92 | ####贡献者 ( Contributors ) : |
100 | 93 | Samana: for heavy work of MSVC compatability |
|
0 commit comments