资源列表
a+b
- 实现了两个大数的加法，速度很快．最大可以是５００位数的相加-realized the majority of the two Adder, very fast. It is the largest of the median combined 500
yakebidiedaifa
- 数值分析算法雅可比迭代法，用C语言实现。-numerical analysis algorithm Jacobi iteration, using C language.
1915
- poj1915求移动棋子到特定位置的最少次数,BFS经典题目-poj1915 for mobile pawn to a specific location of the minimum number, BFS Classic Title
zoj_1009_Enigma
- 这是一道模拟题目，属于比较容易的，但是其中用到了一个类似于循环队列的东西，感到还是很有意思的-This is a simulation of the subject, are relatively easy, but the cycle is similar to using a queue of things are still very interesting
stackProblem
- 车厢调度问题，用数据结构的栈来实现车厢调度-Train scheduling problem, using the data structure inside the stack to implement scheduling
ZeroLagMACD.mq4
- Metatrader 4, non lagging MACD indicator to be used in Forex trading.
labyrinth
- 迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径-Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths
BUBBLE-SORT
- BUBBLE SORT ALGORITHM USING C LANGUGE
Paradox
- SAT-2 solution by Tarjan Algorithm / problem from spoj
BinarySearch
- 对已排序的数组分别用迭代递归两种算法进行折半查找。-An array of the sort of has respectively with iterative recursion algorithm of two binary search.
space-station-shield
- zoj 题中space station shield 题的源码和注释-space station shield s solution for ACM training
lab
- 对于初始给定的数组,通常存在多个长度大于1的已自然排好序的子数组段.例如,若数组a中元素为{4,8,3,7,1,5,6,2},则自然排好序的子数组段有{4,8},{3,7},{1,5,6},{2}.用一次对数组a的线性扫描就足以找出所有这些排好序的子数组段.然后将相邻的排好序的子数组段两两合并,构成更大的排好序的子数组段({3,4,7,8},{1,2,5,6}).继续合并相邻排好序的子数组段,直至整个数组已排好序。-For the initial given array, usually pre