【摘要】 处理汉字的传统的排序算法,其复杂性最少为O(NlogN)。本文结合概率论知识,提出汉字的分组排序算法,给出算法描述,并证明其算法复杂性为O(N),从而优于传统的排序算法。最后给出实验结果。更多还原

【Abstract】 The traditional sorting algorithms based on comparison have the complexity ofO(NIogN). In this paper,we presented grouping sorting algorithms for Chinese Characters and proved its expected complexity to be O(N). We gave the experiment result with the algo-rithm.更多还原