What should be the Big O of f(n) = n^5 + 2^log(n)?

前端 未结 0 2050
孤独总比滥情好
孤独总比滥情好 2020-11-22 15:08

I came across a problem where I\'ve to select the correct Big O for the function f(n) = n^5 + 2^log(n)... I tried putting large values and found out that n^

相关标签:
回答
  • 消灭零回复
提交回复
热议问题