Computational complexity question

  1. 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:

  2. jcsd
  3. 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.
  4. thank you very much you are precisely correct
Know someone interested in this topic? Share this thead via email, Google+, Twitter, or Facebook

Have something to add?