智能排序：一种快速、高效、鲁棒的基于比较的内部排序算法的设计与分析
Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm
摘要：
智能排序算法是将堆构造过程（堆排序算法）“智能”融合到常规“分区”功能（快速排序算法）中，从而产生快速排序算法的健壮版本。我们还对我们提出的算法的平均情况行为进行了实证分析，并对最佳和最差情况进行了必要的理论分析。它的性能针对一些标准的概率分布进行了检查，包括均匀和非均匀分布，如二项式，泊松，离散和连续均匀，指数和标准正态分布。分析显示出所需的鲁棒性，再加上我们的算法的优良性能。虽然本文假设的静态分割比，其动态版本预计将产生更好的结果。
英文摘要：
Smart Sort algorithm is a "smart" fusion of heap construction procedures (of Heap sort algorithm) into the conventional "Partition" function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases. Its performance was checked against some standard probability distributions, both uniform and non-uniform, like Binomial, Poisson, Discrete & Continuous Uniform, Exponential, and Standard Normal. The analysis exhibited the desired robustness coupled with excellent performance of our algorithm. Although this paper assumes the static partition ratios, its dynamic version is expected to yield still better results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
