On Average Complexity of the Ordering-by-merging Algorithm and Its Application
Bin Zhang, Pla Information · Jisuanji gongcheng · 2004
On the hypothesis of a reasonable probability distribution, this paper analyzes the average complexity of the ordering-by-merging algorithm of two ordered lists and applies the result to the complexity of binary ordering algorithm. In conclusion, an estimate on the average complexity of binary ordering algorithm is achieved.