An Efficient Algorithm of Chinese String Sort in User-Defined Sequence

Existing sort algorithms are difficult to implement Chinese string sort in user-defined sequence. This paper proposes an efficient string sort method in user-defined character order. On the basis of the consecutive numbers which used to define the custom order of characters, the hash table structure is employed to convert each string into corresponding array of integers. By taking the maximum number of characters as the new radix, the Radix sort algorithm is used to implement fast sort of strings in user-defined order. Theory analysis and experiments show that the sort algorithm of this paper can easily achieve Chinese string sort in user-defined order in linear time and space complexity. This sort algorithm has a better time performance than that of Quick Sort algorithm, and it can effortlessly extend to string sort applications of other languages.