文件名称:Job2
- 所属分类：
- 数据结构常用算法
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1.63mb
- 下载次数：
- 0次
- 提 供 者：
- 张**
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
算法导论 思考题2-4逆序对问题：设A[1..n]是一个包含n个不同数的数组。如果在i<j的情况下，有A[i]>A[j]，则称( i , j )就称为A中的一个逆序对(inversion)。给出一个算法，它能用Θ(nlgn)的最坏情况运行时间，确定n个元素的任何排列中逆序对的数目。（提示：修改合并算法）-Algorithm is graded 2-4 reverse introduction to question: set A [1.. n] is A contains n A different number of array. If in the I < j, there may be A [I] > A [j], says (I, j) is called A inversion of (one of the reverse. Give an algorithm, it can NLGN) Θ (the worst running time, determine any arrangement-- a elements in the number of the reverse. (hint: modify merger algorithm)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Job2\2.1.png
....\2.2.png
....\2.3.png
....\Debug\inversion.exe
....\.....\inversion.ilk
....\.....\inversion.obj
....\.....\inversion.pch
....\.....\inversion.pdb
....\.....\Job2.exe
....\.....\Job2.ilk
....\.....\Job2.pch
....\.....\Job2.pdb
....\.....\vc60.idb
....\.....\vc60.pdb
....\inversion.cpp
....\inversion.dsp
....\inversion.dsw
....\inversion.ncb
....\inversion.opt
....\inversion.plg
....\Job2.dsp
....\Job2.dsw
....\Job2.ncb
....\Job2.opt
....\Job2.plg
....\Thumbs.db
....\Debug
Job2
....\2.2.png
....\2.3.png
....\Debug\inversion.exe
....\.....\inversion.ilk
....\.....\inversion.obj
....\.....\inversion.pch
....\.....\inversion.pdb
....\.....\Job2.exe
....\.....\Job2.ilk
....\.....\Job2.pch
....\.....\Job2.pdb
....\.....\vc60.idb
....\.....\vc60.pdb
....\inversion.cpp
....\inversion.dsp
....\inversion.dsw
....\inversion.ncb
....\inversion.opt
....\inversion.plg
....\Job2.dsp
....\Job2.dsw
....\Job2.ncb
....\Job2.opt
....\Job2.plg
....\Thumbs.db
....\Debug
Job2