Register to reply

Computational complexity question

by pemfir
Tags: complexity, computational
Share this thread:
pemfir
#1
Jan16-13, 11:54 AM
P: 4
how can i represent the computational complexity an algorithm that requires the following number of operations: (please see attached document)

$(N-1) + \sum_{i=1}^{N-3}(i+1)(N-2)!/{i!}$
Attached Thumbnails
computational complexity.JPG  
Phys.Org News Partner Mathematics news on Phys.org
'Moral victories' might spare you from losing again
Fair cake cutting gets its own algorithm
Effort to model Facebook yields key to famous math problem (and a prize)
Floating Info
#2
Jan16-13, 01:53 PM
P: 8
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
#3
Jan16-13, 02:02 PM
P: 4
thank you very much you are precisely correct


Register to reply

Related Discussions
Computational complexity with an epsilon Programming & Computer Science 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 & Computer Science 3
Computational complexity General Math 3