摘要
通常使用DFA和ITA算法构造目录树,分别对这两种算法进行了时间复杂性分析,16组实验结果表明DFA算法快于ITA算法。
The DFA and ITA are usually used ITA are presented separately. The results of 16 the ITA. designing a content tree. The time complexities of DFA and group experiments show that the DFA runs more rapidly than
出处
《科学技术与工程》
2009年第20期6208-6210,共3页
Science Technology and Engineering
