Computational complexity question

1. Jan 16, 2013

pemfir

how can i represent the computational complexity an algorithm that requires the following number of operations: (please see attached document)

Code (Text):
$(N-1) + \sum_{i=1}^{N-3}(i+1)(N-2)!/{i!}$

Attached Files:

• computational complexity.JPG
File size:
2 KB
Views:
70
2. Jan 16, 2013

Floating Info

In Big O Notation, that would be simply O(n!) I believe, factorial time. The sum group amounts to (n - 2)! with a coefficient 2 + 1.5 + 0.6666 +... which is discarded (so is the -2), and the n - 1 grows so slow relative to the rest that it can be discarded to.

3. Jan 16, 2013

pemfir

thank you very much you are precisely correct