
#1
Jan1613, 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)




#2
Jan1613, 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.




#3
Jan1613, 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 