-
newTon.m
牛顿插值法进行多项式逼近,matlab编译成功,直接可用(Newton interpolation polynomial approximation method, matlab compiled successfully, directly available)
- 2013-07-09 13:33:06下载
- 积分:1
-
stochreal
随机子空间算法实现 matlab函数 分两步求取 来源于网络(Stochastic Subspace Realization Algorithm
Tohru Katayama, "Subspace Methods for System Identification", Springer)
- 2010-01-20 21:45:18下载
- 积分:1
-
DEAMATLAB-master
dea的ccr模型、超效率模型的m文件和实例(The CCR model of DEA, the M files and examples of the super efficiency model)
- 2017-12-18 18:16:18下载
- 积分:1
-
NHMT
说明: 埃特金不等距插值,有例子,检验过,很顺利(Aitken non-equidistant interpolation, there are examples of tests, it is smooth)
- 2008-11-30 19:02:40下载
- 积分:1
-
matlab版本的动态非结构网格划分程序
matlab版本的动态非结构网格划分程序,希望对你们有用,欢迎下载。(matlab version of the dynamic non-structural meshing program, I hope useful to you, welcome to download.)
- 2012-12-05 13:41:25下载
- 积分:1
-
szfx
数值分析里面的:不动点迭代法、牛顿迭代法、共轭梯度法和最速下降法(Conjugate Gradient)
- 2015-11-18 14:08:22下载
- 积分:1
-
smallest
这是数值计算当中最小二乘法的例子,在matlab中实现(This is the numerical calculations of the least squares method, for example to achieve Matlab)
- 2006-06-07 23:54:29下载
- 积分:1
-
11087 统计逆序对
Description
设a[0…n-1]是一个包含n个数的数组,若在i<j的情况下,有a[i]>a[j],则称(i, j)为a数组的一个逆序对(inversion)。
比如 <2,3,8,6,1> 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。
一个n个元素序列的逆序对个数由三部分构成:
(1)它的左半部分逆序对的个数,(2)加上右半部分逆序对的个数,(3)再加上左半部分元素大于右半部分元素的数量。
其中前两部分(1)和(2)由递归来实现。要保证算法最后效率O(nlogn),第三部分(3)应该如何实现?
此题请勿采用O(n^2)的简单枚举算法来实现。
并思考如下问题:
(1)怎样的数组含有最多的逆序对?最多的又是多少个呢?
(2)插入排序的运行时间和数组中逆序对的个数有关系吗?什么关系?
输入格式
第一行:n,表示接下来要输入n个元素,n不超过10000。
第二行:n个元素序列。
输出格式
逆序对的个数。
输入样例
5
2 3 8 6 1
输出样例
5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array.
For example, <2,3,8,6,1> has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency.
The number of inverse pairs of a sequence of n elements consists of three parts:
(1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half.
The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented?
Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)
- 2019-01-07 23:52:06下载
- 积分:1
-
pro2
用遗传算法求解主动悬架系统的例程,里面附有程序求解的数据以及图形!是个很好的例子(A Genetic Algorithm for Active Suspension System routines)
- 2020-09-18 17:17:56下载
- 积分:1
-
RM
说明: 计算两组向量之间的旋转矩阵。输入参数为在两个不同坐标系中的同名向量(模为1),返回参数是一个3X3的旋转矩阵。(The function of RM realize the rotation between two sets of vectors, whose magnitude are 1, defined in two different refrence frames. Input parameters are two sets of vectors r and b, return value is a rotaton matrix.)
- 2011-07-05 09:54:33下载
- 积分:1