基于商和余数的快速排序算法

A Quick Sorting Algorithm for Quodent and Remainder

文章提出了一种对任意整数都适用的基于商和余数的快速排序算法,给出了算法的描述,其时间复杂性为O(Max(n,△M)),只需附加约n+△M个存储空间(其中△M为待排序数组关键字的变化范围)。

This paper gives out a quick sorting algorithm for quotient and remainder; its algorithm description is given. It proves that with the random integer sequence, the new sorting method has a time complexity of O(Max(n, △M)), and requires about n+△M extra space only (here, △M is the change scope of the key of original data).