合并排序的最差性能和平均性能为o (n log n)。

Merge sort has o (n log n) worst-case and average-case performance.

youdao

但节点在空间上分布不均以及在每轮稳定阶段担当簇首的节点能耗不均都会使得网络平均性能下降。

But the nodes are random in area, and the energy consumption isn't well-distributed in every steady-state phase, so that the average performance of networks declines.

youdao

对快速排序算法，基于枢轴元素的随机选取这一前提条件，对这一算法进行了时间平均性能的分析。

To the problem of quick-sort, the authors give an average capacity analysis of the algorithm which is based on random choice 'pintle'.

youdao