资源列表
hill
- 希尔排序。通过C语言实现。能正常运行。但需要帐户才能下载。请见谅。
约瑟夫环问题link
- 学生初学，c实现约瑟夫环(圆桌问题)，算法应该不是很高效，望各位高人看了改进改进！-beginner students, c achieve Joseph Central (round table), the algorithm should not be very efficient, a person looking to improve reading improvement!
Cpp1
- Kmeans算法的C++实现，很简短的一个算法-Kmeans algorithm C++ Achieved a very brief algorithm
3070Fibonacci
- Pku 3070 Fabbonacci矩阵乘法解法c++代码-Pku 3070 Fabbonacci matrix multiplication method c++ Code
Separar.c
- Separar - Separate the dictionary for data quantization-Separar- Separate the dictionary for data quantization
23442
- 实现二叉树的中序，先序，后序三种遍历的功能。-Binary tree in order to achieve first order, the order of three kinds oftraversal functions.
Queue
- Its about the data structure Q-Its about the data structure Queue...
zhandeshixian
- 《数据结构》中用c++代码实现栈，包括基本操作。-" Data Structure" using c++ code to achieve the stack, including the basic operation.
Fresnel_Integrals
- Compute Fresnel integrals C(x) and S(x)
selectort
- 通用选择法排序C++源程序，例程为电脑随机数排序。-Sort the universal selector law Sort C++ source, routine computer random number.
LDSComplex
- Simple C++ library for complex numbers arithmetic
hebinglianbiao
- 设A与B分别为两个带有头结点的有序循环链表（所谓有序是指链接点按数据域值大小链接，本题不妨设按数据域值从小到大排列），list1和list2分别为指向两个链表的头指针。请写出将这两个链表合并为一个带头结点的有序循环链表的算法。-Let A and B are two ordered circular list with a header node (the so-called orderly clicking the link refers to the size of the data fie