-
FFT
FFT源代码 FFT源代码 FFT源代码(FFT source code FFT source code FFT source code)
- 2021-03-09 16:59:27下载
- 积分：1
-
MCZTFFT
说明： CZT和FFT的C语言实现代码，能有效滤除谐波，噪声。获得信号的频率，是一种良好的频率测量算法。(CZT and FFT of the C language code, can effectively filter out harmonics and noise. Access to the signal frequency, is a good algorithm for frequency measurement.)
- 2020-11-19 19:29:38下载
- 积分：1
-
SQP
本算法是基于数值计算中的SQP编写的MATLAB程序。非常实用的一个小程序。(This algorithm is based on the numerical calculation of SQP written MATLAB program. Very practical one small program.)
- 2020-12-29 10:39:00下载
- 积分：1
-
mie-uu36
合成孔径雷达（SAR)目标成像仿真，多姿态，多角度，有不同光照,小波包分析提取振动信号中的特征频率。( Synthetic Aperture Radar (SAR) imaging simulation target, Much posture, multi-angle, have different light, Wavelet packet analysis to extract vibration signal characteristic frequency.)
- 2017-04-09 13:35:34下载
- 积分：1
-
spgl1-1.8
based classification (SRC) has been widely used for face
recognition (FR). SRC first codes a testing sample as a
sparse linear combination of all the training samples, and
then classifies the testing sample by evaluating which class
leads to the minimum representation error. While the
importance of sparsity is much emphasized in SRC and
many related works, the use of collaborative representation
(CR) in SRC is ignored by most literature.
- 2013-08-02 16:14:29下载
- 积分：1
-
Rcellsse
读入红细胞图片，通过中值滤波，开运算算，闭运算，和贴标签等方法获得细胞个数
(Read into the red blood cell picture, opening operation count median filtering, and closing operation, and the labeling methods such as cell number)
- 2012-07-28 23:59:33下载
- 积分：1
-
Euler-backward-difference-scheme
欧拉向后差分格式的程序文件，可直接调用，在科学计算中有很重要的应用.(Euler backward difference scheme of program files can be called directly,which have important applications in scientific computing.)
- 2015-12-22 11:13:05下载
- 积分：1
-
diankuozhanhanshuhuoqu
点扩展函数的获取，最小二乘法估计PSF，验证通过，直接运行(Get the point spread function, least squares estimation PSF, verified by direct operation)
- 2016-04-27 07:57:52下载
- 积分：1
-
bubble-dynamic-mesh
气泡根据内外压力差变化的动网格。。。。。。(bubble dynamic mesh )
- 2014-02-10 15:52:37下载
- 积分：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
