对不等长度的字符串序列字典排序

对不等长度的字符串序列字典排序 LEXICOGRAPHIC SORT OF STRINGS OF VARYING LENGTH 徐绪松 Xu Xusong 1 first-author 武汉大学经济管理系 武汉大学经济管理系 Department of Economic Management, Wuhan University Department of Economic Management, Wuhan University 本文提出了一个对不等长度的字符串序列按字典顺序进行排序的算法。该算法的特点是:在存贮方面,按其串的实际长度存放串;在算法技巧上,利用非空表、长度表,按其串的长度的递减顺序进行基数排序。由于又巧妙地应用了链式分配的队结构,使得整个排序过程不是移动串,而是移动串指针,因此它用尽量少的存贮空间和线性的计算时间完成了排序工作,特别适应于数据量较大的信息处理。 This paper provides a sort algorithm——Lexicographic sort of strings of varying length. The characteristics of this algorithm are: In the storage, the strings are stored up according to their actual lengths. In the algorithm, with the help of lists nonempty and lists length, radix sorting can be completed according to the order of decreasing length of the strings. Besides, using queue structure of linked allocation, the whole sort processing involves the move of the pointer, instead of the move of the string. Therefore, the sort processing can be completed consuming littler storage space and linear computation time. This method is suitable especially for the information processing of quite an amount of data. 不等长字符串 字典顺序 排序算法 信息处理 Strings of varying length Lexicographic sequence Sort algorithm Information processing 1989-02-01 2021-04-01 2