快速排序和快速选择的分区方案
Partitioning schemes for quicksort and quickselect
摘要:
我们介绍了几个修改的分区计划中使用的霍尔的快速排序和快速选择算法,包括三元方案,确定键小于或大于枢轴。我们估计每个计划的互换数量。我们的计算实验表明,三进制方案允许快速选择,以确定所有的键等于选定的键在很少的额外成本。
英文摘要:
We introduce several modifications of the partitioning schemes used in Hoare's quicksort and quickselect algorithms, including ternary schemes which identify keys less or greater than the pivot. We give estimates for the numbers of swaps made by each scheme. Our computational experiments indicate that ternary schemes allow quickselect to identify all keys equal to the selected key at little additional cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。