登录
首页 » DOS » hw03_solution

hw03_solution

于 2012-10-08 发布 文件大小:41KB
0 131
下载积分: 1 下载次数: 2

代码说明:

  n of the parity check matrix

文件列表:

hw03_solution.doc,163328,2012-01-25

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • shengbomoni
    二维交错网格声波模拟(加PML边界条件)地震(Two-dimensional staggered grid acoustic simulation (plus PML boundary conditions) earthquake)
    2012-07-04 17:20:11下载
    积分:1
  • gonglvjisuan
    此程序为潮流计算的最后一部分功率计算程序。(This program is the last part of the power flow calculation calculation program.)
    2009-09-15 20:42:08下载
    积分: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
  • bp
    说明:  c++编程bp神经网络,用c++语言编写的bp神经网络(C++ programming bp neural network, bp neural network written in c++ language.)
    2018-04-28 15:09:52下载
    积分:1
  • wangf
    王勖成《有限单元法》里面的教学源程序,PROGRAM OF PLANE PROBLEM 96.1(Wang Aimin, "Finite Element Method," in which the source of teaching, PROGRAM OF PLANE PROBLEM 96.1)
    2021-01-03 18:38:55下载
    积分:1
  • seagrid
    说明:  任意边界结构正交曲线网格生成程序,使用方便简单(Arbitrary boundary structure of orthogonal curvilinear grid generation procedure, easy to use simple)
    2008-11-15 18:13:09下载
    积分:1
  • cpso
    粒子群算法在解决非线性方程上的应用,给出了详细程序(Particle swarm algorithm for solving nonlinear equations, gives detailed procedures)
    2012-09-12 11:14:34下载
    积分:1
  • mpso
    多目标粒子群优化算法,利用粒子群算法原理编写优化两个目标函数。(Multi-objective particle swarm optimization algorithms, particle swarm optimization principle to write to optimize the two objective functions.)
    2020-12-30 20:38:59下载
    积分:1
  • couette-matlab
    安德森《计算流体力学及其应用》第九章不可压库埃特流的数值解 9.3节 数值方法:隐式克兰克—尼科尔森方法。(Anderson the computational fluid mechanics and its application "chapter 9 do not YaKu etta flow numerical solution of section 9.3 numerical methods: implicit g frank- Nicholson method. )
    2012-08-23 22:11:26下载
    积分:1
  • a.c
    Finding special triples of the form (n, n + 1, n + 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n + 1, n + 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.(Finding special triples of the form (n, n+ 1, n+ 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n+ 1, n+ 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.)
    2012-04-26 15:05:05下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载