Recursion

*To*: mathgroup at smc.vnet.net*Subject*: [mg70367] Recursion*From*: "Susan" <priyapalmfield at gmail.com>*Date*: Sat, 14 Oct 2006 03:07:26 -0400 (EDT)

Does any one know how to write a recursive procedure for n!n(n-1)/4 and also a recursive procedure to find all the permutations of degree n with k cycles For eg: There are 3 permutations of degree 3 with 2 cycles [1,3,2] [2,1,3] and [3,2,1] Thanks for any help Susan Philip