https://github.com/caneroj1/pranker
Ranking and unranking permutations are operations that can be used to solve various permutation-related problems, such as generating random permutations or determining the lexicographic successor of a given permutation.
https://github.com/caneroj1/pranker
Last synced: about 2 months ago
JSON representation
Ranking and unranking permutations are operations that can be used to solve various permutation-related problems, such as generating random permutations or determining the lexicographic successor of a given permutation.
- Host: GitHub
- URL: https://github.com/caneroj1/pranker
- Owner: caneroj1
- Created: 2014-09-12T18:52:22.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2014-09-12T18:54:58.000Z (over 10 years ago)
- Last Synced: 2025-02-03T11:47:41.764Z (4 months ago)
- Language: C++
- Size: 148 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
PRanker
=======
Ranking and unranking permutations are operations that can be used to solve various permutation-related problems, such as generating random permutations or determining the lexicographic successor of a given permutation.
The basic idea for these algorithms came from: http://www.math.ucsd.edu/~gptesler/184a/slides/rank_s13-handout.pdf