| 一种不受内存限制的快速排序法 |
| |
| 引用本文： | 文朴,文艺.一种不受内存限制的快速排序法[J].成都理工大学学报(自然科学版),1990(3). |
| |
| 作者姓名： | 文朴 文艺 |
| |
| 作者单位： | 成都地质学院地质矿产勘查系
(文朴)，四川石油研究院(文艺) |
| |
| 摘 要： | 文中介绍了一种数据的排序方法。此法不受数据量的限制,计算速度非常快,比以往的方法提高效率多倍,唯数据的最大值与最小值之差不能过大。对于PC—1500A机来讲,这个差值不得大于2650。
|
| 关 键 词： | 数据分组 数据排序 频数 程序 内存 |
A RAPID ORDERING WITHOUT INTERNAL MEMORY LIMITATION |
| |
| Wen Pu,Wen Yi.A RAPID ORDERING WITHOUT INTERNAL MEMORY LIMITATION[J].Journal of Chengdu University of Technology: Sci & Technol Ed,1990(3). |
| |
| Authors: | Wen Pu Wen Yi |
| |
| Institution: | Wen Pu;Wen Yi |
| |
| Abstract: | This paper introduces a method for data ordering. This method is not limit-ed by data amount, and has a very rapid speed of calculation. Comparing with the oldmethods, it can rise the calculation rate to be of many times. Only the ranges betweenmaximum and minimum of data can't be too big. For PC-1500A pocket computer, thisdifference must be less than 2650. |
| |
| Keywords: | data ordering frequency program internal memory |
| 本文献已被 CNKI 等数据库收录！ |
