首页> 外文会议>International Conference on Asian Language Processing >An Efficient Algorithm of Chinese String Sort in User-Defined Sequence
【24h】

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.
机译:现有的排序算法很难以用户定义的顺序实现中文字符串排序。本文提出了一种有效的以用户定义的字符顺序进行字符串排序的方法。基于用于定义字符自定义顺序的连续数字,哈希表结构用于将每个字符串转换为相应的整数数组。通过将最大字符数作为新的基数,Radix排序算法用于以用户定义的顺序实现字符串的快速排序。理论分析和实验表明,本文的排序算法可以轻松地以用户定义的顺序实现中文字符串的线性和时空复杂度排序。这种排序算法比快速排序算法具有更好的时间性能,并且可以毫不费力地扩展到其他语言的字符串排序应用程序。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号