采用枢轴抽样的QuickXsort平均成本
Average Cost of QuickXsort with Pivot Sampling
摘要:
QuickXsort是一种将Quicksort与另一种排序方法X相结合的策略,因此结果与隔离的X具有基本相同的比较成本,但即使X需要线性大小的缓冲区,也会进行排序。我们精确地解决了QuickXsort的递归问题,直到线性项,包括从k个元素的样本中选择枢轴的优化。这允许仅使用排序方法X的平均成本立即获得总平均成本(就像孤立运行一样)。因此,我们扩展并大大简化了QuickHeapsort和QuickMergesort的分析,实际上有效的枢轴选择,并给出了第一个紧的上界,包括线性项,这样的方法。
英文摘要:
QuickXsort is a strategy to combine Quicksort with another sorting method X, so that the result has essentially the same comparison cost as X in isolation, but sorts in place even when X requires a linear-size buffer. We solve the recurrence for QuickXsort precisely up to the linear term including the optimization to choose pivots from a sample of k elements. This allows to immediately obtain overall average costs using only the average costs of sorting method X (as if run in isolation). We thereby extend and greatly simplify the analysis of QuickHeapsort and QuickMergesort with practically efficient pivot selection, and give the first tight upper bounds including the linear term for such methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。