Abstract: This article puts forward a new sort algorithm … the subfield map quick sort method. It makes a great amount of modification based on Ref.[5] and belongs to a distributive sort. In this algorithm, the key words; distribution is considered only, comparison and exchanges of key words being omitted. The purpose of the work is to solve the problem:why the sort method of Ref.[5] fails when the key word is long and, the data are not equally distributed. The theoretical analysis and the experimental results prove that the efficiency of the algorithm is higher than Hoare's in the ordinary case, and the algorithm is appropriate for large-scale information sort.

Key words: memory overhead, subfield map, sort, distributive type, sort speed