瑞萨读iic

全排列算法采用分治递归的思想，举例来说就是，假设给出一串数字要求进行全排列，则先保持该数字串的第一位不动，其后的数字进行全排列，排列思想依旧，然后将该数字串的第一位和第二位置换，在进行全排列，以此类推，进行递归排列。

个人原创的数据回归性分析的fortran，编程无误使用方便，可以根据自己实际情况进行适当修改

约瑟夫环-Josephus

数字滤波算法； 中间位置算法 算术平均值算法--middle value algorithm, medimum value algorithm.

QSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSDDQSDQSDQSDQSDQSDQSDQSDQSDQSDQSDQSDQSDQSDQSDQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSDDDDDDDDQSDQSQSQSDQSQSDQSDQSDQSDQSDQSDQSDQSDQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQSQS

gauss-seidel迭代法解Ax=b的解-Gauss- Seidel iterative method for Ax = b Solution

C[i,j] 表示点i+1，i+2到点j中，选择任意一个点作为根，在（j-i）个解中找出成本最小的最优解 向前递推过程： 首先计算所有j-i=1的C(i, j) 然后依次计算j-i=2,3,…,n的C(i,j)。 C(0,n)=最优二分检索树的成本。 初始值 C(i,i) = 0 W(i,i) = Q(i)，0≤i≤n 最优二分检索树的构造 在计算C(i, j)的过程中，记下使之取得最小值的k值，即树Tij的根，记为R(i, j)。 依据R(0, n)…，推导树的形态

有N件产品，既可以选择用A独立机器完成，也可以选择用B机器独立完成。产品i用A机器和B机器生产所有的时间分别为ai和bi。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

线性规划模型与整数规划 线性规划模型与整数规划-Linear programming model with integer programming linear programming model with integer programming

基于MSP430F20X1的信号合成程序.采用C语言编程.实现两路输入信号(一路为传感器脉冲信号,另一路为开关信号)的合成输出.