资源列表
Prim
- Prim最小生成树 Prim最小生成树-PrimPrimPrimPrimPrimPrimPrimPrimPrimPrimPrimPrim
xianxingbiao
- 使用VC编写的线性表程序，简单明了，方便使用-Written in linear form using the VC program, simple and clear, easy to use
Fibonacci
- Code of Find Fibonacci, public class Fibonacci { looping main(...) }-Code of Find Fibonacci, public class Fibonacci { looping main(...) }
Untitled1
- 关于kingt moves的源码 验证正确 acm的题目-About kingt moves the source verify that the correct subject acm
binary-search
- binary search in files
6
- 堆排序是一树形选择排序，在排序过程中，将R[1..N]看成是一颗完全二叉树的顺序存储结构，利用完全二叉树中双亲结点和孩子结点之间的内在关系来选择最小的元素。-Heap sort is a tree selection sort, the sort process, the R [1 .. N] as the order of a complete binary tree storage structure, the use of complete binary tree in the paren
ex1
- 输入数据进行排序，排序后输出，在屏幕上显示-Sort the input data, sort the output on the screen display
MyFraction
- haskell的四则运算，计算平方根公式等简单程序-The haskell arithmetic, the calculation formula of the square root simple procedures
sort
- 快速排序算法，三路排序算法的一些使用和比较。三路排序算法的一些性能分析-Quicksort algorithm, some use of the three sorting algorithms and compare. Performance Analysis of the three sorting algorithms
ltxt
- 使用VC++ 6.0开发石油能源专业软件粘度分析算法程序代码-Using VC++ 6.0 development of oil and energy professional software viscosity analysis algorithm code
rimages
- This scr ipt take the image of the parameter one, resize and resample this and save the resampled image in the dir of parameter 2, the third parameter is for set the dimensions (you should change this in the scr ipt code.
beibao
- 设有一个背包可以放入物品的重量为s，现有n件物品，重量分别为w[0],w[1],...,[n-1]。问题是能否从这n件物品中选择若干件放入此背包中使得放入的重量之和正好等于s。-Has a backpack can be placed in the weights of the articles of s, the existing n items, weight W [0], w [1], ..., [n-1]. The question is whether this certain wei