资源列表
shape.rar
- 无网格算法 mls形函数 可以用于无网格算法编程运算中,meshless method mls shape function
householderqr
- householder 矩阵 qr分解程序-householder matrix qr decomposition process
ran2
- 随机数发生器，可以生成随机数的随机函数cpp开发环境 -Random number generator, can generate random numbers of random function cpp development environment
Sorting-algorithm
- 排序算法 数据结构 做课设自己做的，可以进行数字排序。-Sorting algorithm data structure to do the lesson set up their own do
GJDN
- 全选主元高斯-约当消去法同时求解系数矩阵相同而右端具有m组常数向量的线性代数方程组AX=B的全部解-QuanXuan primary gaussian-about when elimination technique and then the coefficient matrix is the same and the right side of the constant vector with m linear algebra equations AX = B of all solutions
luoxuanjunzheng
- 螺旋矩阵的实现的代码,运用遍历-Spiral matrix
CG
- 共轭梯度法迭代求解线性方程组，通过迭代求得方程组的近似解，收敛速度较快-congruent gradient
2-10
- 可将二进制装换为十进制，支持浮点数据，有效位数可以自己设定。-Installed binary converted to decimal, support for floating-point data, the effective number of bits can be set.
0-1Jump
- 用动态规划去解答0-1背包问题，此方法是在经典背包问题上进行的跳跃点优化而解答出来的，已成功通过编译调试-Using dynamic programming to answer 0-1 knapsack problem, this method is carried out on the classic knapsack problem jumps out optimization solutions, has successfully passed the compiler debugging
Knight-tOUR
- Knight tour algorihtms, C-Knight tour algorihtms, C++
BInsertSort
- 折半插入排序在查找记录插入位置时，采用折半查找算法 折半查找比顺序查找快, 所以折半插入排序在查找上性能比直接插入排序好 -Binary insertion sort to find records insertion position, using a binary search binary search algorithm is faster than the sequential search, binary insertion sort on so look better pe
saler
- 动态规划解决tsp问题，初学者使用，测试城市建议少于10个，调试环境为vs2013。-Dynamic programming to solve tsp problem, beginners, recommended that fewer than 10 test cities, debugging environment for vs2013.