- Category:
- Data structs
- Tags:
-
- File Size:
- 240kb
- Update:
- 2018-01-04
- Downloads:
- 0 Times
- Uploaded by:
- 陈辛
Description: 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.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 分治法求众数\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 |
Download