【摘要】 文章提出了一种循环插入的排序方法。给出了算法思想、算法描述、算法分析和实验结果。其理论意义是改进了一类时间复杂度为O(N2)排序法的时间复杂度,其实用价值是该排序法在一类时间复杂度为O(N2)排序法中排序效率较高的,其平均排序速度比直接插入排序法、选择排序法、冒泡排序快50%～63%。更多还原

【Abstract】 In this paper,a circular insertion sort method is put forward.and its algorithmic ideas,and algorithmic description,and its algorithmic analysis,and its experimental results is given.The theoretical significance lies that the circular insertion sort has improved time complexity of the sorts whose time complexity is O(N2).Its practical value is that the circular insertion sort ’s sorting efficiency is relatively higher than the sorts whose time complexity is O(N2);the average sorting speed is 50%faster than straight insertion,selection and bubble sort.更多还原