算法的某个run的运行时间也是随机的 Let Time(C)10 be the time complexity of the run C of A on z.Then the expected time complexity of A on x is Eap-TimeA(x)=E[Time]=>ProbA,(C).Time(C), Time(c)本质上是意思？ Different runs of A on an input x may alsohave different lengths,i.e.,they may have different costs.So,the time complexity becomes a random variable.算法的某个run的运行时间也是随机的 Time(C)本质上是意思？