I was wondering.. what is the complexity of an algorithm that starts with n elements (which I run through doing whatever). I take one element off, I do it again.. I take off another element and do it again until I have just one element left. is it O(n log n)? I can't visualize it...
2 Answers
To solve the complexity for O(n+n-1+n-2....n times), we need to use Sum for mathematics formula by see this link
=> n+n+n...n times - (1+2+3...n times)
=> n^2- (n^2+n)/2
Complexity will be
(n^2-n)/2
Related