Polynomial

采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)

一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)

棋盘覆盖，算法分析，很有用的东西，大家一起来分享一下(Board covers, algorithm analysis, useful things, we share together)

随机函数产生10000个随机数，用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序，并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义，系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)

c语言的一些小李子，初学c的朋友有帮助，主要有顺序表、二分查找、二叉树、单链表等等(Some Survival Song c language, c beginner to help a friend, there are sequence tables, binary search, binary tree, a single linked list, etc.)

数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)

这是高精度大数运算的源码,对于大于64位的整形数字的四则运算，是万能的啊……(This is the code of big number s operator.)

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)

数据结构 堆栈 实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)