When I try
Permutations[Range[1, 12]]; // AbsoluteTiming
I get
{53.6949, Null}
and with Permutations[Range[1, 14]]; // AbsoluteTiming
the computer takes hours.
Is this true in general, or is it a slow function in Mathematica?
Is there any very fast way of getting the permutations of the list $ \{1, 2, \dots, n\} $? Perhaps with parallel processing?