Over the years many sort algorithms have been produced, and the time complexity of unchangeable long-records place algorithms still is O(N²). It can t satisfy needs of large-scale information treatment. On the basis of Refs. [1,2], the new algorithm is mentioned in this note to enhance the sort speed. In this algorithm, the keywords is mapped to array element subscript and we don t carry out two operations of comparision and exchanges of keywords. Its time complexity is O(N), and the algorithm is appropriate to widely used large-scale information treatment in the future.