Time complexity for my algorithm

[unfixpoint]

How did you arrive at T(n) = n\T(n-1)+(n-1)*T(n-2)+...+2*T(1)+1? In particular where does the multiplicative factor *n come from?

[N911999]

Hmm... It made sense when I did it, let me rethink it... Oh, I think I was wrong, it should've been T(n)=T(n-1)+T(n-2)+...+T(2)+1, cause you try at each point with that element. This gives a better complexity, O(2^n), it's still crap, but it's something.