Andrew Kensler's permute()
Summary
This article explains Andrew Kensler's permute(), a stateless, constant-time pseudorandom-order array iterator. It covers the problem it solves, the underlying cycle-walking invertible-hash approach, and practical optimizations, contrasting with Fisher-Yates and incremental sampling. It provides code snippets and a final implementation for generating random, unique indices efficiently.