文件名称:algorithms-master
介绍说明－－下载内容均来自于网络，请自行研究使用
1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo.
1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。
已实现 ( Implemented ):
Array shuffle
Prime test(trial division)
Prime test(Miller-Rabin s method)
2D Array
Arbitary Integer
Linear congruential generator
Maximum subarray problem
Bit-Set
Queue
Stack
Binary Heap
Fibonacci Heap
Priority Queue (list based)
Bubble sort
Selection sort
Insertion sort
Radix sort
Quick sort
Merge sort
Heap sort
Double linked list
Skip list
Self-organized linked-list ops (move-to-front, move-ahead-one)
Largest common sequence
Binary search tree
Dynamic order statistics
Red-black tree
Interval tree
Prefix Tree(Trie)
Suffix Tree
B-Tree
Suffix Array等-(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!)
1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。
已实现 ( Implemented ):
Array shuffle
Prime test(trial division)
Prime test(Miller-Rabin s method)
2D Array
Arbitary Integer
Linear congruential generator
Maximum subarray problem
Bit-Set
Queue
Stack
Binary Heap
Fibonacci Heap
Priority Queue (list based)
Bubble sort
Selection sort
Insertion sort
Radix sort
Quick sort
Merge sort
Heap sort
Double linked list
Skip list
Self-organized linked-list ops (move-to-front, move-ahead-one)
Largest common sequence
Binary search tree
Dynamic order statistics
Red-black tree
Interval tree
Prefix Tree(Trie)
Suffix Tree
B-Tree
Suffix Array等-(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
algorithms-master
.................\.gitignore
.................\CMakeLists.txt
.................\LICENSE
.................\Makefile
.................\README.md
.................\darwin12.supp
.................\demo_graph.png
.................\include
.................\.......\2darray.h
.................\.......\8queen.h
.................\.......\LRU_cache.h
.................\.......\astar.h
.................\.......\base64.h
.................\.......\bellman_ford.h
.................\.......\binary_search_tree.h
.................\.......\bitset.h
.................\.......\bloom_filter.h
.................\.......\btree.h
.................\.......\bubble_sort.h
.................\.......\dijkstra.h
.................\.......\directed_graph.h
.................\.......\disjoint-set.h
.................\.......\dos_tree.h
.................\.......\double_linked_list.h
.................\.......\edmonds_karp.h
.................\.......\fib-heap.h
.................\.......\generic.h
.................\.......\graph_defs.h
.................\.......\graph_search.h
.................\.......\hash_code.h
.................\.......\hash_multi.h
.................\.......\hash_string.h
.................\.......\hash_table.h
.................\.......\heap.h
.................\.......\heap_sort.h
.................\.......\huffman.h
.................\.......\imath.h
.................\.......\insertion_sort.h
.................\.......\integer.h
.................\.......\interval_tree.h
.................\.......\k-means.h
.................\.......\kmp.h
.................\.......\kruskal_mst.h
.................\.......\lcs.h
.................\.......\max_subarray.h
.................\.......\md5.h
.................\.......\merge_sort.h
.................\.......\palindrome.h
.................\.......\perfect_hash.h
.................\.......\prim_mst.h
.................\.......\prime.h
.................\.......\priority_queue.h
.................\.......\queue.h
.................\.......\quick_sort.h
.................\.......\radix_sort.h
.................\.......\random.h
.................\.......\random_select.h
.................\.......\rbtree.h
.................\.......\rbtree_defs.h
.................\.......\relabel_to_front.h
.................\.......\scc.h
.................\.......\selection_sort.h
.................\.......\sha1.h
.................\.......\shuffle.h
.................\.......\simhash.h
.................\.......\skiplist.h
.................\.......\sol.h
.................\.......\sort.h
.................\.......\stack.h
.................\.......\suffix_array.h
.................\.......\suffix_tree.h
.................\.......\trie.h
.................\.......\undirected_graph.h
.................\.......\universal_hash.h
.................\.......\word_seg.h
.................\msvc
.................\....\alg_vs.h
.................\....\stdbool.h
.................\src
.................\...\8queue_demo.cpp
.................\...\LRU_cache_demo.cpp
.................\...\astar_demo.cpp
.................\...\base64_demo.cpp
.................\...\bellman_ford_demo.cpp
.................\...\binary_search_tree_demo.cpp
.................\...\bitset_demo.cpp
.................\...\bloom_filter_demo.cpp
.................\...\btree_demo.cpp
.................\...\bubble_sort_demo.cpp
.................\...\dict.txt
.................\...\dict.txt.sogou
.................\...\dijkstra_demo.cpp
.................\...\directed_graph_demo.cpp
.................\...\disjoint-set_demo.cpp
.................\...\dos_tree_demo.cpp
.................\...\double_linked_list_demo.cpp
.................\...\edmonds_karp_demo.cpp
.................\...\fib-heap_demo.cpp
.................\...\graph_demo.cpp