字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构...

数据结构之对栈的应用之实现各个进制的转换-Data structure on the stack of applications to achieve the various hexadecimal conversion

模拟人走迷宫,主要实现一般操作的程序，数据结构-simulated people Maze, the main general operating procedures, data structure

大整数整除，char *d返回余数，char*c返回结果 -Large integer divisible, char* d return the remainder, char* c return result

应用程序,面向课程设计-applications, design-oriented courses

数据结构的课程设计题目，各种排序方法，并计算花费时间- The construction of data curriculum designs the topic, each arrangement method, and the computation spends the time

常用算法的C语言描述。里边算法非常详尽。解压即可使用。-common algorithms described in C language. Inside algorithm very detailed. Decompression can be used.

这是我学习数据结构与算法时编的关于队列操作的程序，对学习数据结构的朋友有帮助-This my learning algorithm and data structure when the series of the operation of the queue on procedures for the study of the data structure to help friends! !

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① 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

此篇代码的功能是关于K路文件的归并，用于数据结构，算法等设计-Cipian functionality of the code files on K road merging, for data structures, algorithm design

关于大数据的Coursera课程的第二个任务。火星任务