-
wolfe
wolfe程序模块的C++算法,可以重复使用,对于解决一维搜索是很好的..(C++ algorithm wolfe program modules can be reused for solving one-dimensional search is good ..)
- 2014-02-25 15:11:57下载
- 积分:1
-
3nodes
基于牛拉法的电力系统潮流计算,该程序是计算IEEE3节点的,采用matlab编程(Cattle Rafah-based power system load flow calculation, the program the calculation IEEE3 node, using matlab programming)
- 2020-12-17 21:29:12下载
- 积分:1
-
牛顿迭代法求解非线性方程组
说明: 牛顿法又称牛顿-拉弗森方法(Newton-Raphson method),是一种在实数域和复数域上近似求解方程的方法。本程序收敛速度快,迭代步数可取大一些(Newton method, also known as Newton-Raphson method, is an approximate method for solving equations in real and complex fields. The program has fast convergence speed so the number of iteration steps can be larger.)
- 2019-05-13 21:08:38下载
- 积分:1
-
solve_equations
几个使用的解线性方程组的程序,包括高斯消去法,高斯列主元法,高斯——赛德尔消去法。简明实用。(Gauss elimaination, Gauss_seidel ellimination)
- 2013-12-08 17:42:57下载
- 积分:1
-
c_and_f
c/C++跟fortran语言之间的一些转换(c/C fortran language with the conversion between)
- 2007-05-31 13:46:32下载
- 积分:1
-
Python for Data Analysis, 2nd Edition
Python for Data Analysis
DATA WRANGLING WITH PANDAS,
NUMPY, AND IPYTHON
- 2018-09-15 23:03:37下载
- 积分:1
-
11087 统计逆序对
说明: Description
设a[0…n-1]是一个包含n个数的数组,若在ia[j],则称(i, j)为a数组的一个逆序对(inversion)。
比如 有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, 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
-
LLC设计参考
半桥LLC详细设计流程。包括自己设计的和别人设计的参考(detailed design of half bridge LLC)
- 2020-06-24 01:20:02下载
- 积分:1
-
FDTD
西安电子科技大学葛德彪教授书后所附fortran程序(Xidian University, Professor Ge Debiao book accompanying fortran program)
- 2020-07-03 18:20:02下载
- 积分:1
-
NSGA2-MOPSO
NSGA2 and MOPSO algorithms
- 2018-04-20 19:51:36下载
- 积分:1