arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.5422cs.DScs.CC
收藏

使用堆排序的字符串排序分析

Analysis of String Sorting using Heapsort

Igor Stassiy

摘要:

在这篇硕士论文中,我们分析了一组字符串排序的复杂性。结果表明,排序字符串的复杂性可以很自然地表示在由字符串的集合诱导的前缀trie。计算模型考虑了符号比较,而不仅仅是字符串之间的比较。给出了快速排序和归并排序等经典算法在该模型下的上下界分析。在这里,我们将分析扩展到另一个经典的算法-堆排序。我们还分析了使用二项式堆作为堆实现的算法版本。

英文摘要:

In this master thesis we analyze the complexity of sorting a set of strings. It was shown that the complexity of sorting strings can be naturally expressed in terms of the prefix trie induced by the set of strings. The model of computation takes into account symbol comparisons and not just comparisons between the strings. The analysis of upper and lower bounds for some classical algorithms such as Quicksort and Mergesort in terms of such a model was shown. Here we extend the analysis to another classical algorithm - Heapsort. We also give analysis for the version of the algorithm that uses Binomial heaps as a heap implementation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑