For further actions, you may consider blocking this person and/or reporting abuse
How is generative AI increasing efficiency?
Join AWS GenAI LIVE! to find out how gen AI is reshaping productivity, streamlining processes, and driving innovation.
Read next
DeepSeek R1: Math Model Trades Speed for Accuracy in Complex Problem-Solving
Mike Young -
AI Language Models Show Strange "Hyperfitting" Effect When Fine-Tuned for Precision
Mike Young -
New 4-Bit Training Method Cuts AI Model Memory Usage in Half While Maintaining Accuracy
Mike Young -
AI Models Still Fail Basic Physics Tests, New Benchmark Shows 18.4% Improvement Possible
Mike Young -
Top comments (2)
If you want to create permutations, most algorithms are recursive. That means if you only want the 10,000th permutation you have to calculate the 9999 permutations before it. I was interested in calculating random-access permutations so every permutation calculation takes the same amount of time. So I wrote an algorithm and wrote up the process here.
The first time I used recursion in production code and then reused it for something slightly different. It's basically a tree traversal that gives users a sequence of different choices that depend on the previous choice.