冒泡排序和汉诺塔问题的递归算法实验报告好东西来下载啊

对实矩阵进行奇异分解的算法，能够满足精度的要求-Real singular matrix decomposition algorithms, to meet the requirements of precision

使用递归实现的快速排序法-Quick sort using recursive

巴特沃斯、切比雪夫I和椭圆滤波器设计的源程序！非常难得！ 简洁的C语言编写-Butterworth, Chebyshev I and elliptic filter design of the source! Very rare! Concise C language

先序遍历非递归算法 #define maxsize 100 typedef struct { Bitree Elem[maxsize] int top }SqStack void PreOrderUnrec(Bitree t) { SqStack s StackInit(s) p=t while (p!=null !StackEmpty(s-preorder non- recursive algorithm# define maxsize 100 typedef struct (Bitree Elem [maxsize]) int top SqStack void PreOrderUnrec (Bitree t) (SqStack s StackInit (s) p = t while (p! = Null! StackEmpty (s

一个关于下载文件客户程序的小程序，欢迎大家下载，如有问题，请和我联系。-download files on a client"s computer and you are welcome to download, if there are questions, please contact me.

一维等离子体的plrc―fdtd算法程序-one-dimensional plasma plrc- fdtd Algorithm

#include #include #include #include using namespace std;class Queen{ friend int nQueen(int);private: bool Place(int k); void Backtrack(int t); void Output(); int n,//皇后个数  *x;//当前解 long sum;//当前已找到的可行性方案数};bool Queen::Place(int k){ for (int j=1;jn) {  sum++;  Output(); } else {  for (int i=1;i

基本矩阵运算 : + - *, power, transpose, trace, determinant, minor, matrix of minor, cofactor, matrix of cofactor, adjoint, inverse, gauss, gaussjordan, linear transformation, LU decomposition , Gram-Schmidt process, similarity. b) Basic vectors functions : norm, distance, innerproduct,coldim, rowdim, rank, nullity. *-basic matrix calculation :-*, power, transpose, trace, determinant, minor, matrix of minor, cofactor, the matrix of cofactor, adjoint, inverse, Gauss, gaussjordan, linear transformation, LU decomposition, Gram-Schmidt process, the similarity. B ) Basic vectors functions : norm, distance, innerproduct, coldim, rowdim, rank, nullity.*

一维伽辽金型无网格法MATLAB程序 无网格方法采用基于点的近似，可以彻底或部分地消除网格，不需要网格的初始划分和重构，不仅可以保证计算的精度，而且可以大大减小计算的难度。然而，由于目前的无网格近似一般没有解析表达式，且大都基于伽辽金原理，因此计算量很大，要超出传统的有限元法；另外，无网格近似大都是拟合，因此对于位移边界的处理比较困难，多采用拉格朗日乘子法处理。-1维伽Galerkin-type meshless method MATLAB procedures meshless method based on the point of approximation, can be completely or partially eliminate the grid, the grid does not require the initial division and reconstruction, not only can guarantee the accuracy of the calculation, and can greatly reduce the difficulty of calculation. However, due to the current meshless approximation there is no analytic expression in general, and mostly based on the Galerkin principle, the calculation of a large volume, it is necessary to go beyond the traditional finite element method In addition, the meshless approximation are fitted, so displacement of the border more difficult to deal with, the use of Lagrange law.

采用vs2008 c#编写 Q-Learning强化学习的代码实现 状态空间5维，动作空间5维-Using vs2008 c# Q-Learning reinforcement learning the code to achieve the state-space five-dimensional, five-dimensional action space