【摘要】 针对文本处理中的字串去重问题 ,本文提出了四种有效的快速算法 ,其平均时间复杂度为O(nlogn) ,空间复杂度为O(n)。其中利用首字hash方法的去重算法比直接利用快速排序算法具有更好的性能 ,其思想可用于改进快速排序算法。更多还原

【Abstract】 In this paper,we suggest several fast algorithms for removing redundant strings in a string set,their time complexity is O(n log n ) and space complexity is O(n). When processing Chinese strings,we first utilize hashing operation with the first Chinese character,then sort the string subset and remove redundant strings,which is superior to sorting by using quicksort directly.We spend only 50ms in removing 194 redundant items in a Chinese Biology Electronic Thesaurus including 11008 items.更多还原