題目如下: We know that the runtime complexity of a program depends on the program input combinations --- Suppose the probability of the program with runtime complexity O(n) is p, where p << 1, and in other cases (i.e for the (1-p) possible cases), the runtime complexity is O(logn). If we are running the program with K different input combinations, where K is a very large number, we can say that the amortized runtime complexity of this program is: (A) O(logn) (B) O(p*n) (C) O(K*logn) (D) O(K*p) (E) O(K*pn) 這一題我想了很久很久> <" 感覺應該是Ｃ，可是又不確定 誰能教一下... -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.123.235.119