解决方法
在数组几乎排序的假设下,您可以使用以下之一：
Wiki甚至有一个java实现就可以了.因为你不能比O(n)快得多(因为为了甚至找出数组是否排序需要很多时间)smoothsort是一个不错的选择.更多细节here.
The advantage of smoothsort is that it
comes closer to O(n) time if the input
is already sorted to some degree
The complexity of cocktail sort in big
O notation is O(n2) for both the worst
case and the average case,but it
becomes closer to O(n) if the list is
mostly ordered before applying the
sorting algorithm,
