Hacker News new | ask | show | jobs
by randomthought 4468 days ago
what about (n(n+1)/2)< 1000 n^2 ? .
1 comments

He interpreted it as "the time complexity of computing the sum of the numbers from 1 to n", which using the formula you just gave takes O(1) time.