|
1 | 1 | ###Algorithms & Data Structures in C++ |
2 | 2 |
|
3 | | -征C++高手加入此项目,巭孬嫑, 目标: ( Need volunteers for code review, bugfix. goal: ) |
| 3 | +征C++高手加入此项目,巭孬嫑, 目标: ( Need volunteers for code review, bugfix. goal: ) |
4 | 4 |
|
5 | | - 经典的算法实现 |
| 5 | + 经典的算法实现 |
6 | 6 | (classical algorithms implementations) |
7 | | - 服务器端 |
| 7 | + 服务器端 |
8 | 8 | (based on linux/gcc) |
9 | 9 | 正确,易于使用和改造, 一个头文件一个算法,并附带一个demo. |
10 | 10 | (corret! and ease of use, one .header file per algorithm) |
11 | | - |
12 | | -约定:( Convention : ) |
13 | | - |
14 | | - 1. 一个算法用一个.h文件表示放到include下. ( one .header file per algorithm. ) |
15 | | - 2. 算法演示的demo程序放到src下. ( one demo per algorithm. ) |
| 11 | + |
| 12 | +约定:( Convention : ) |
| 13 | + |
| 14 | + 1. 一个算法用一个.h文件表示放到include下. ( one .header file per algorithm. ) |
| 15 | + 2. 算法演示的demo程序放到src下. ( one demo per algorithm. ) |
16 | 16 | 3. 程序正确通过后,请发起Pull Requests,代码被验证后入库,并在README中发布新算法实现。 |
17 | | - (Please Use Fork+Push Requests !!! Correctness is the most important!) |
18 | | - |
19 | | -已实现: ( Implemented : ) |
| 17 | + (Please Use Fork+Pull Requests !!! Correctness is the most important!) |
| 18 | + |
| 19 | +已实现: ( Implemented : ) |
20 | 20 |
|
21 | 21 | Array shuffle |
22 | 22 | Prime test(trial division) |
23 | 23 | Prime test(Miller-Rabin's method) |
24 | 24 | 2D Array |
25 | | - Arbitary Integer |
| 25 | + Arbitary Integer |
26 | 26 | Linear congruential generator |
27 | 27 |
|
28 | 28 | Bit-Set data structure |
29 | 29 | Queue data structure |
30 | 30 | Stack data structure |
31 | 31 | Binary heap data structure |
32 | | - Priority queue |
| 32 | + Priority queue |
33 | 33 |
|
34 | 34 | Insertion sort |
35 | 35 | Radix sort |
|
38 | 38 | Double linked list |
39 | 39 | Skip list |
40 | 40 | Self-organized linked-list ops (move-to-front, move-ahead-one) |
41 | | - Largest common sequence |
| 41 | + Largest common sequence |
42 | 42 |
|
43 | 43 | Binary search tree |
44 | 44 | Dynamic order statistics |
45 | 45 | Red-black tree |
46 | | - Interval tree |
| 46 | + Interval tree |
47 | 47 | Prefix Tree(Trie) |
48 | 48 | *Suffix Tree(未实现)* |
49 | 49 |
|
|
56 | 56 | SimHash |
57 | 57 | Bloom Filter |
58 | 58 | SHA-1 Message Digest Algorithm |
59 | | - MD5 |
| 59 | + MD5 |
60 | 60 |
|
61 | 61 | Graph data structure |
62 | 62 | Prim's minimum spanning tree |
|
65 | 65 | Depth First Search |
66 | 66 | Dijkstra's algorithm |
67 | 67 | Bellman-Ford algorithm |
68 | | - Edmonds-Karp Maximal Flow |
| 68 | + Edmonds-Karp Maximal Flow |
69 | 69 |
|
70 | 70 | Huffman Coding |
71 | 71 | Word segementation(CHN/GB18030) using HMM and viterbi algorithm. |
72 | | - A* algorithm |
| 72 | + A* algorithm |
73 | 73 | K-Means |
74 | 74 | Knuth–Morris–Pratt algorithm |
75 | | - |
| 75 | + |
0 commit comments