Expressions about algorithm complexity

前端 未结 0 848
温柔的废话
温柔的废话 2021-01-18 03:13

I would like to know ways to prove it. Because I have no idea:

n + log n is Θ(n);

100n is Ω(n2) ; f(n) is O(f(n/2));

For the two functions g(n) and f(n

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