If n objects are to be permuted, this can be done in n! different ways. One finds several algorithms on the internet producing tables of permutations
with fancy properties. I once found a fast algorithm to compute the Nth permutation of length n (0
You may contact with the website administrators and ask them where they got this algorithm from.
Good luck with that.
This algorithm connects Factorial Number System with permutations.
Maybe this is the first article about it:
Laisant, Charles-Ange (1888), "Sur la numération factorielle, application aux permutations", Bulletin de la Société Mathématique de France (in
French) 16: 176–183.
Since, i can't get it from your algorithm, i implement it in few lines of Python from the article given by Vera.
You can get it from the attached link.
https://github.com/christophesaintjean/christophesaintjean.github.io/blob/master/Python/Factorial%20numeration%20and%20permutations.ipynb
Ahmad, the perl website still exists but the content is far too old and the purpose was just to show off with a compact program. There was no further reference.
Vera, the paper you cited indeed contains the required information. Thank you. I somehow expected the procedure to link with an old result.
Christophe, your implementation is probably more efficient than my old C-implementation.
Thanks to all. I can now give due reference whenever I use this kind of algorithm.
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Algorithms