computational complexity question

pemfir

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

Code:

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

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.

pemfir

thank you very much you are precisely correct

Similar Threads for: computational complexity question
Thread	Forum	Replies
Computational complexity with an epsilon	Programming & Comp Sci	1
Energy and computational complexity of atomic interactions	General Physics	0
How is computational complexity determined?	General Math	1
How to find computational complexity?	Programming & Comp Sci	3
Computational complexity	General Math	3

pemfir	computational complexity question Tweet how can i represent the computational complexity an algorithm that requires the following number of operations: (please see attached document) Code: $(N-1) + \sum_{i=1}^{N-3}(i+1)(N-2)!/{i!}$ Attached Thumbnails

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.