Recursive algorithm to find number of Permutations

Question

I need to use a recursive algorithm to find

Permutations(X,Y) . Inputs X and Y are positive long intergers with The return value (a long) number of ordered ways X objects can be drawn from N objects.

Answer 1

You mean drawn from Y objects??