{"shas":[["44415e937892c986a7ea4184bdf1700f3722bf96","ded022db89399a060a39da31922f173c6556c2d9@m-merkert.de","Rank and Unrank for permutations (depending on n)\n\n* Recursive and iterative functions that give a bijection between the\n  numbers from 0 to n! and the permutations of n elements, modeled as\n  vectors of length n.","Olaf Merkert"]],"repo":"OlafMerkert/combinatorics","actor":"OlafMerkert","ref":"refs/heads/master","size":1,"head":"44415e937892c986a7ea4184bdf1700f3722bf96","actor_gravatar":"b809af100743c1f358e52fe49a7f8789","push_id":30917347}