svick
2012-02-13 05:47:22
The big O notation can be used to determine the growth rate of any function.
In this case, it seems the book is not talking about the time complexity of computing the value, but about the value itself. And n(n+1)/2 is O(n^2).
热门帖子
热门github
6
I read in a textbook Karumanchi that 1+2+3+...+k = k(k+1)/2 >n => k=O(√ n). How this happened. Can you please explain this to me...Thanks