资源列表
duifen
- 数值分析课程中的“对分区间法”的实现，适合初学者适用-Numerical Analysis Course " on inter-partition method" can be realized, suitable for beginners
gj
- Gauss-Jordan for ecuation solving
belman(2)
- Dijkstra算法中要求边的权非负，如果遇到负权，则可以采用Bellman-Ford算法。-about bellman-ford
Deletesomeelements
- 用单链表实现中间某一段元素的删除，例如：1.2.3.4.5.6.7.8删除比3大比6小的数。-delete some elemts……
1125
- The best solution of problem 1125 of Caribbean Online Judge using a crazy tree with some minor modifications-The best solution of problem 1125 of Caribbean Online Judge using a crazy tree with some minor modifications...
fft
- 一个简单的c程序，用来实现FFT的功能@@！！ -A simple c program to implement FFT function @ @! !
p_c5
- 该程序提供了作业调度算法的源码描述，主要是时间片轮转和高优先权优先算法-The program provides a descr iption of the source job scheduling algorithms, mainly time slice algorithm for rotation and high-priority priority
KMP
- KMP 算法 数据结构中的经典算法 源代码-Data structures, algorithms, code KMP
boyi
- 有四堆苹果，每堆都有三个苹果，甲乙二人博弈，每人每次只能从一堆苹果中拿走任意多个苹果，拿走全部四堆中最后一个苹果的人判定为失败。-Apple has four reactors, each reactor has three apples, two B game, each person can only take away from the pile of apples in any number of apples, take all four reactors to determine t
inorderAndpreorder
- 此代码是实现基于数据结构算法二叉树的原理，用递归的方法实现把中序遍历转换成前序遍历输出-This code is a recursive method based on the principle of data structure algorithms binary tree traversal sequence converted to pre-order traversal output
dayin
- 打印二叉树，在学习数据结构方面有一定的帮助，同时在打印二叉树时能够真实的体会到二叉树的原理-Print binary tree data structure in the study have some help, but when printing a binary tree can truly appreciate the principle of a binary tree
maxSubSequence
- 最大序列，C++语言编写的最大序列，挺好的东西-Maximum sequence, written in c++ language biggest sequence, quite good