资源列表
nearest
- 给定n个点，其坐标为（xi,yi）(0<=i<<=n-1),要求使用分治法策略求解设计算法，找出其中距离最近的两个点。两个点间距离公式为： -nearest two point
BigNumMultiply
- 整数的大数相乘，用于大数相乘的操作数是整数的情况！-Big Integers multiply！
simplex
- Simplex method for C works for any input
2
- solving with graffea method
none1
- This program solves for a given equation using 3 methods
paixu
- 排序算法 快速排序 桶排序 归并排序 冒泡排序 插入排序-all kinds of sorts
math
- Math foundation of finite element method on porous media
TheTomesOfDelphiAlgorithmsAndEnormousCandCDescribe
- 算法与数据结构_C与C++描述,主要是针对如何灵活运用数据结构实现算法-Algorithms and Data Structures with C++ descr iption _C
fibonacci
- Simple progams scr ipt for Fibonaci
Bessel
- 用白塞尔方法实现大地主题解算，正算反算都有。-Bessel method implementation with the solution of geodetic problem, there are inverse operators.
4-7
- 输入数值，判断位数，输出相应数字，倒序输出原值-The corresponding figures for the input value output, reverse output at cost
xiangcheng
- 用c和c++语言编写的矩阵相乘的源代码,非常有用的哦。-C++ matrix multiply