{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiau3ccdb6gmensc4vtjsg47xvmuylzlbr4hee6glvvinhisiecpqe",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mglxmkrc6tm2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.05676v1",
  "publishedAt": "2026-03-09T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Ofek Gila",
    "Michael T. Goodrich",
    "Vinesh Sridhar"
  ],
  "textContent": "**Authors:** Ofek Gila, Michael T. Goodrich, Vinesh Sridhar\n\nWhile modern general-purpose computing systems have ample amounts of memory, it is still the case that embedded computer systems, such as in a refrigerator, are memory limited; hence, such embedded systems motivate the need for strictly in-place algorithms, which use only O(1) additional memory besides that used for the input. In this paper, we provide the first comparison-based sorting algorithms that are strictly in-place and have a running time that is optimal in terms of the run-based entropy, H(A), of an input array, A, of size n. In particular, we describe two remarkably simple paradigms for implementing stack-based natural mergesort algorithms to be strictly in-place in O(n(1 + H(A))) time.",
  "title": "How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms"
}