In this paper,a new sorting algorithm of high repetition rate any type data is proposed.This algorithm with conciseness of the quick sorting method avoids recursive algorithm.It has the time complexity O(n) and space complexity O(1) only.Both theoretical%对于重复率较高的任意类型大量数据的排序,文中提出了一种新算法。该算法具有快速排序算法的简洁性,又避开了递归算法,时间复杂度为O(n),空间复杂度为O(1)。理论分析和实验表明,该算法的性能明显优于其它排序算法,适合于数据量较大的场合。
展开▼