| N个整数平均化的两种算法实现 |
| |
| 引用本文： | 刘丽华.N个整数平均化的两种算法实现[J].宁夏师范学院学报,2003,24(3):6-9,13. |
| |
| 作者姓名： | 刘丽华 |
| |
| 作者单位： | 陕西理工学院,数计系,陕西,汉中,723000 |
| |
| 摘 要： | 在只允许移动相邻元素的条件下．运用最大值优先法和端值优先法蛤出了移动次数最少的算法。实例证明算法是可行的．
|
| 关 键 词： | 平均值 最大值优先法 端值优先法 |
| 文章编号： | 1001-0491(2003)03-0006-04 |
Two Algorithms of Obtaining the Average Value of A Certain Number of Integers |
| |
| LIU li-hua.Two Algorithms of Obtaining the Average Value of A Certain Number of Integers[J].Journal of Ningxia Teachers College,2003,24(3):6-9,13. |
| |
| Authors: | LIU li-hua |
| |
| Abstract: | Only neighboring elements moved, applying the rule of maximum priority and endpoint-value priority can obtain the algorithms with minimum times of moving. And these algorithms have been proved practically. |
| |
| Keywords: | average value maximum priority endpoint value priority |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
