一种O(n+nlog_2m)时间复杂度的排序算法

A Sorting Algorithm with O(n+nlog_2m) Time Complexity

通过分析任意输入的 n个数据的组成特性 ,设计一种 O( n +nlog2 m)时间复杂度的排序算法 ,m为原始输入数据序列中有序 /逆有序的子序列个数 ,1≤ m≤ n/2。

By analyzing the characteristics of the n given input data,a sorting algorithm with O(n+n log 2 m) time complexity is presented,where m is the number of the sorted or conversely sorted sub-sequences in the original input sequence,1≤m≤n/2.The time complexity result is independent of the hypothesis of the probability distribution of the input data.