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.
This is a script I wrote in Python/Ruby that processes match information from the game Dota 2. The branch v2 has the new Ruby code that get matches and the Python code that processes a match.
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