基于数据结构的相关知识点，构造的基数排序

魔王语法解释 数据结构的实验和实验报告，包含实验报告，源码等-Devil syntax explained the experimental data and experimental structure of the report, including test reports, source code, etc.

归并排序，C代码，初学者可以看一下，大家分享一下-Merge sort, C code, and beginners can take a look, we share with you

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

MATHEMATICA 程序 最短路径算法-MATHEMATICA procedure shortest path algorithm

定时备份Oracle数据库和文件的程序 支持RAR压缩功能-Regularly back up Oracle databases and documents in support of RAR compression

][String]有多种方法可以使整个字符串排列，（不重复）整个数组，还有字典方法

图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read

学生信息管理系统，使用C++和QT语言编写而成，其中使用到数据库操作，本程序仅能在qt5以上版本运行。其中的编码需要转换。文件中还包括本人的实习论文一份！

约瑟夫环实现

实现KMP算法。 经典的模式搜索算法。-KMP algorithm realization. Classical algorithms.