摘要
In the algorithm from Ref. [1], if the difference between the maximum and the minimum, E】】N(Nis the number of data), or the data are very long, the speed of the sort method will slow down. The main reason is that there are too many times that the long data fall into the same grade after being contracted. In this letter the algorithm of subfield map is presented to keep the main characteristics of Ref. [1]. By this algorithm, the logn data
