{
  "id": 19555468,
  "title": "Andrew Kensler's permute(), a function for stateless, constant-time pseudorandom-order array iteration",
  "url": "https://urgent.news/2026/11/11/andrew-kenslers-permute-a-function-for-stateless-constant-time",
  "topic": "tech",
  "section": "Tech",
  "published": "2026-11-11T20:08:45.000Z",
  "source": {
    "name": "Lobsters",
    "slug": "lobsters",
    "url": "https://andrew-helmer.github.io/permute/"
  },
  "original_language": "en",
  "account": "Andrew Kensler's permute() function is a stateless, constant-time pseudorandom-order array iteration technique that is useful in various fields such as graphics and cryptography. The function solves the problem of iterating over k items of an array of length n in random order without duplicates. Unlike the Fisher-Yates shuffle, permute() requires O(k) time and O(1) memory, making it more efficient for iterating over a random sample of k items from an array of length n. Kensler introduced permute() in his paper Correlated Multi-Jittered Sampling, and it has been applied in various areas beyond its initial use in graphics and cryptography.",
  "summary": null,
  "key_points": [],
  "editors_take": null,
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}