-
2
说明： 地球处理多边体的重磁异常的正演，主要是地球数据处理的课程的实验项目2(The forward modeling of gravity and magnetic anomalies in the earth s processing of the multilateral body is mainly the experimental project of the earth data processing course 2)
- 2016-03-14 21:28:38下载
- 积分：1
-
Computational-Science-codes
开发环境没有可选项，fortran90,Fortran_90_and_Computational_Science-_codes(Computational Science codes by fortran90
)
- 2013-10-10 17:07:12下载
- 积分：1
-
Floating-point-complex-radix-2-decimation-in-time-
浮点复数基2时分FFT完成适当的FFT，输出改写输入缓冲器。(floating-point complex FFT-based two hours to complete the FFT output rewritten input buffer.)
- 2006-08-07 14:19:25下载
- 积分：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
-
Euler2Quaternion
欧拉角与四元数 欧拉角与四元数 欧拉角与四元数 欧拉角与四元数 欧拉角与四元数(you you you you you you you you you you you you you you you you my )
- 2014-05-08 21:29:38下载
- 积分：1
-
Numerical_Recipes
《数值分析方法库_第三版
》本书选材内容丰富，包括了当代科学计算过程中涉及的大量内容：求特殊函数值、随机数、排序、最优化、快速傅里叶变换、谱分析、小波变换、统计描述和数据建模、偏微分议程数值解、若乾编码算法和任意精度计算等。本书科学性和实用性统一，不仅对每种算法进行了数学分析和比较，而且根据作者经验对算法给出了评论和建议，并在此基础上提供了用C++语言编写的实用程序。
(《Numerical Recipes 3rd Edition: The Art of Scientific Computing》, Do you want easy access to the latest methods in scientific computing? This greatly expanded third edition of Numerical Recipes has it, with wider coverage than ever before, many new, expanded and updated sections, and two completely new chapters. The executable C++ code, now printed in color for easy reading, adopts an object-oriented style particularly suited to scientific applications. Co-authored by four leading scientists from academia and industry, Numerical Recipes starts with basic mathematics and computer science and proceeds to complete, working routines. The whole book is presented in the informal, easy-to-read style that made earlier editions so popular. Highlights of the new material include: a new chapter on classification and inference, Gaussian mixture models, HMMs, hierarchical clustering, and SVMs a new chapter on computational geometry, covering KD trees, quad- and octrees, Delaunay triangulation, and)
- 2020-12-02 20:09:25下载
- 积分：1
-
PRequation
工程领域，PR方程代码.用于计算混合工质性质。(PR equation code)
- 2020-09-04 16:58:09下载
- 积分：1
-
shannon
香农编码的C语言实现，VC++环境~~~~~~~~~~~~~~~~~~~~~~~~~(Shannon C-language coding, VC++ environment ~~~~~~~~~~~~~~~~~~~~~~~)
- 2010-05-27 11:01:01下载
- 积分：1
-
qiuni
C语言矩阵求逆模块,输入矩阵调用此模块即可求出对应的逆矩阵(C language matrix inversion module)
- 2013-12-16 21:18:18下载
- 积分：1
-
hunhefahanshufa
罚函数法 它将有约束最优化问题转化为求解无约束最优化问题: 其中M为足够大的正数, 起"惩罚"作用, 称之为罚因子, F(x, M )称为罚函数.(hunhefahanshufa)
- 2020-12-02 01:49:27下载
- 积分：1
