标签: time-complexity big-o complexity-theory lower-bound upperbound
嘿,请在这里帮助我,我不知道该怎么做,我很快就会提交
a1(n)=5, a2(n)=2^nlogn, a3(n)=n^100 a4(n)=n^n a5(n)=n! a6(n)=(0.5)^log(base2)n
答案 0 :(得分:0)