分治法求众数

所属分类：数据结构

开发工具：C/C++

文件大小：240KB

下载次数：3

上传日期：2018-01-04 20:19:09

上 传 者：九鼎

说明：  给定含有n个元素的多重集合S，每个元素在S中出现的次数称为该元素的重数。多重集S中重数最大的元素称为

众数。例如，S={1，2，2，2，3，5}。多重集S的众数是2，其重数为3。

求众数方法很多，现要求你用分治算法来试一试，并分析其效率。

编程任务：对于给定的由n个自然数组成的多重集S，采用分治算法编程计算S的众数及其重数。

(Given a multiple set of S with n elements, the number of times each element appears in the S is called the weight of the element. The element with the largest number of weights in a multiple set S is called

Mode. For example, S={1, 2, 2, 2, 3, 5}. Multiple sets of S mode is 2, the number is 3.

A lot of methods for the plural, you are requested to use algorithms to try, and analyze its efficiency.

Programming tasks: for a natural number n consists of multiple sets of a given S, the algorithm calculates the number of programming mode and the weight of S.)

文件列表：[举报垃圾]

分治法求众数\bin\Debug\分治法求众数.exe, 1057934 , 2017-12-01

分治法求众数\bin\Debug\分治法求众数.opt, 43520 , 2017-12-01

分治法求众数\main.cpp, 2595 , 2017-12-01

分治法求众数\obj\Debug\main.o, 12227 , 2017-12-01

分治法求众数\分治法求众数.cbp, 1089 , 2017-12-01

分治法求众数\分治法求众数.depend, 131 , 2017-12-01

分治法求众数\分治法求众数.layout, 356 , 2017-12-01

分治法求众数\bin\Debug, 0 , 2017-12-01

分治法求众数\obj\Debug, 0 , 2017-12-01

分治法求众数\bin, 0 , 2017-12-01

分治法求众数\obj, 0 , 2017-12-01

分治法求众数, 0 , 2017-12-01

近期下载者：

相关文件：

收藏者：