An efficient algorithm of chinese string sort in user-defined sequence

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2013 International Conference on Asian Language Processing, IALP 2013
Pages253-256
Number of pages4
DOIs
Publication statusPublished - 2013
Event2013 International Conference on Asian Language Processing, IALP 2013 - Urumqi, Xinjiang, China
Duration: 17 Aug 201319 Aug 2013

Publication series

NameProceedings - 2013 International Conference on Asian Language Processing, IALP 2013

Conference

Conference2013 International Conference on Asian Language Processing, IALP 2013
Country/TerritoryChina
CityUrumqi, Xinjiang
Period17/08/1319/08/13

Keywords

  • Hash table structure
  • Radix sort
  • String sort
  • User-defined order

Fingerprint

Dive into the research topics of 'An efficient algorithm of chinese string sort in user-defined sequence'. Together they form a unique fingerprint.

Cite this