资源列表
polynormal
- 多项式插值，可作内插，外插，分段，阶数任意，插值后的结果由原数组返回。-polynomial interpolation and can be used for interpolation, extrapolation, segmentation, arbitrary order, the interpolation results to the original array.
huanghuowenti
- 这是一个N皇后问题，采用递归的方法，希望对大家有帮助 -N Queen's, using recursive method, we hope to help
Dijkstra
- dijkstra算法，可以求解图论中的两点间最短路径
sobel
- 用于图象边缘检测，是一个视频采集的基础-for image edge detection, is a collection of video
Huffuman_decoding
- 哈夫曼解码，主要应用于数字图像的压缩编码。-Huffman decoding, mainly used in digital image compression coding.
huiwen
- 利用顺序队列验证输入的一段字符并判断是否为回文-Order to verify the use of input queue and for some characters to determine whether the palindrome
postfixexpression
- 运用栈的基本运算。（进栈、出栈） 依次扫描表达式的操作数并入栈，遇到运算符时，将后进的两个操作数出栈，对其进行运算，将运算结果入栈。照此方法，进行下去，一直到执行完最后一个运算符，输出结果。-The use of basic computing stack. (Into the stack, out of the stack) followed by scanning the expression operands and stack encountered operator, it wil
progcodbok
- codbouk of compression in lifting
tree
- 二叉树先序、中序、后序的递归和非递归算法-First order binary tree, in order, the order of the recursive and non-recursive algorithm
Josephu
- Josephu 问题为：设编号为1，2，… n的n个人围坐一圈，约定编号为k（1<=k<=n）的人从1开始报数，数到m 的那个人出列，它的下一位又从1开始报数，数到m的那个人又出列，依次类推，直到所有人出列为止，由此产生一个出队编号的序列。-Josephu issues: Let numbered 1,2, ... n of the n individuals sitting around, agreed number k (1 < = k < = n) the number
Test_THD_First
- 计算12脉波输入侧电流谐波率THD程序，可扩展到其他多脉波的计算中。-The 12-pulse input current THD procedure can be calculated and extended to other multi-pulse calculation.
Phi_Time_Invariant
- Calculation of the kernel matrix and the state vector for TI systems by calculating Phi matrix