can anyone tell me what is the logic behind this algo?

Question

Algorithm to generate permutations
For every number k (0 function permutation(k, s) {
var int factorial:= 1;
for j = 2 to length(s) {
factorial := factorial* (j-1);
swap( s[j - ((k / factorial) mod j)], s[j]);
}
return s;
}
Notation
•k / j denotes integer division of k by j, i.e. the integral quotient without any remainder, and
•k mod j is the remainder following integer division of k by j.

s is a set of which i have to generate all possible permutation

Answer 1

---abay jhand do ka pahada hai---

Answer 2

It returns the result of the permutation of k and s. As the result may be very large, the result is stored in array instead of integer or any number-type variable.

Answer 3

Hey Arpit, this certainly looks interesting. Can you just elaborate more on the input and output, what is K and S?

Answer 4

sorry i dont know