资源列表
SJJG4.00
- 希尔排序的相关算法，经检验可运行。数组自行修改-Hill sort of correlation algorithm, the test can be run. Array to modify
kal1
- estimation of random constant using kalman filter
3
- 用程序实现ROMBER算法,数值分析贝格尔算法,简单,明了.可以轻松实现.-Procedures to achieve ROMBER algorithms, numerical analysis Berger algorithm, simple to understand. Can easily achieve.
is_palindrom
- check whether sth is palindrom
classList
- 设计了一个栈，可以添加删除节点。并且用最快的速度返回最大值-A STACK OF ADDING AND DELETING NODE
bubblesort
- This simple code is made up of java, we did it last semester, it is the so called bubblesort.
rev
- 计算逆序数，用的是归并排序方法实现的。时间复杂度和归并排序方法的一样-Reverse calculation of the number of ways using a merge sort implementation. Merge sort time complexity, and the same method
diedaifa
- // 编程序 用迭代法求a的立方根,求立方根的迭代公式为 ::Xi+1=（2*Xi）/3+a/(3*Xi*Xi) 假定X的初值为a,迭代到|Xi+1-Xi|<10的-5次方为止. 显示a=3,27的值,并通过调用pow(a,1.0/3)函数加以验证.。-//Compile a program with Iteration Method and the cube root, find the cube root of the iteration formula is:: Xi+1 = (2*
bisection
- source code for implementation of bisection method of numerical analysis methods in mathematics.
strtok
- 实现window下strtok(char *a,char *b) 函数的功能，在a中查找b并返回指向azhongb的指针，如果a为NULL返回前位置-strtok function program
PSO
- 参数寻优，通过设定初值，寻找满足函数的最优值，但可能陷入局部最优。对初值要求较高-Parameter optimization, by setting the initial value, looking to meet the optimal value of the function, but are likely to fall into the local optimum. Higher on initial
jicha
- 给定n个正整数数列，进行如下操作：每次删去两个数 a和b，添加1个数 a*b+1,直到只剩1个数N。在所有的这样的N中，有1个最大Max的和最小的Min，M=Max-Min是极差。设计程序计算 M -Given n positive integers, proceed as follows: each time deleting two numbers a and b, add a number of a* b+1 until only a number of N. All this N,