3 ms·
No if you generate them out of order, you can just use a permutation function and have zero memory requirements. This algorithm is only fast given that sequent
by tripzilch 7y ago
No if you generate them out of order, you can just use a permutation function and have zero memory requirements.
This algorithm is only fast given that sequential access is much faster than random access (and you don't need your output shuffled).