Processing math: 100%

Algorithm - 特殊時間函數

特殊的函數

  • (logn)logn

nloglogndd×logn<loglogn×lognloglogn×logn<logn×lognlogn×logn<nn<n×log2nloglogn>ndnloglogn<2n

  • (logn)!

n!nn+12en(Stirlingapproximation)(logn)!(logn)logn+12elogn(logn)logn+12nloge(logn)logn+12n1nloglogn(logn)12n1(logn)!<(logn)logn

  • n1logn

n=2logn(2logn)1logn2logn1logn21=2

  • 22logn

2=n1lognn2lognlogn0<2lognlogn<1logn<n2lognlogn<nc,cZ+,c1

  • (loglogn)!
f(n) log f(n)
n! nlognO(logn)
2n nlog2O(logn)
(logn)! (logn)loglognO(logn)
n2 2lognO(logn)
logn loglognO(logn)
24 4log2O(logn)

f(n) 為「Polynominal bound」 logf(n)O(logn)

log((loglogn)!)=(loglogn)(logloglogn)(loglogn)(logloglogn)(loglogn)2(loglogn)(logloglogn)=O(logn)(loglogn)!Polynominalbound