空间复杂度 average case T(n) = expected time over all input of size n (need assuption ) 一定概率下所有时间总和的平均值 insertion sort worest time :