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.
Most of these projects were for classes I have taken while studying at TCNJ, but numericalIntegration, Dota2_Script, and Number Converter were projects I worked on in my spare time.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
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.
tms
jammer
Markov word generator