文件名称:zhongshu
- 所属分类：
- 其他小程序
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2014-10-22
- 文件大小：
- 6kb
- 下载次数：
- 0次
- 提 供 者：
- Zoe****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
给定含有n个元素的多重集合S，每个元素在S中出现的次数称为该元素的重数。多重集S中重数最大的元素称为众数。例,S={1,2,2,2,3,5}。多重集S的众数是2，其重数是3。
2.算法设计
对于给定的n个自然数组成的多重集S，计算S的众数及其重数。
-Given n elements containing multiple set S, the number of times each element appears in the S called the multiplicity of the element. Multiple sets the maximum number of S in heavy elements called plural. Embodiment, S = {1,2,2,2,3,5}. Multiple sets the mode S is 2, and its multiplicity is 3.
2 Algorithm Design
For a given multiset S n natural numbers composed of plural computing S and multiplicity.
2.算法设计
对于给定的n个自然数组成的多重集S，计算S的众数及其重数。
-Given n elements containing multiple set S, the number of times each element appears in the S called the multiplicity of the element. Multiple sets the maximum number of S in heavy elements called plural. Embodiment, S = {1,2,2,2,3,5}. Multiple sets the mode S is 2, and its multiplicity is 3.
2 Algorithm Design
For a given multiset S n natural numbers composed of plural computing S and multiplicity.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
lab2_1.dsw
lab2_1.ncb
lab2_1.opt
lab2_1.plg
lab2_1.cpp
lab2_1.dsp