摘要
处理汉字的以比较为基础的二分查找算法，其复杂性为Ｏ（ＮｌｏｇＮ）。本文结合概率论知识，提出汉字的随机分组查找算法和分组散列查找算法，给出算法描述，并证明其算法复杂性为Ｏ（Ｎ），从而优于二分查找算法。最后给出实验结果。
The binary searching algorithm based on comparison have the complexity of O(NlogN).Inthis paper, we presented random blocking searching algorithms for Chinese Characters and blocking scattering searching algorithms for Chinese Characters. We proved their expected complexity to be O(N). We gave the experiment result with these algorithms.
出处
《中文信息学报》
CSCD
1995年第2期45-50,共6页
Journal of Chinese Information Processing
关键词
汉字
随机分组查找
分组散列查找
分组查找
Chinese Character, Binary searching, Random blocking searching, Blocking scattering searching, Probability distribution.
