{"paper":{"title":"Rate of convergence of major cost incurred in the in-situ permutation algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sumit Kumar Jha","submitted_at":"2016-11-15T10:51:39Z","abstract_excerpt":"The in-situ permutation algorithm due to MacLeod replaces $(x_{1},\\cdots,x_{n})$ by $(x_{p(1)},\\cdots,x_{p(n)})$ where $\\pi=(p(1),\\cdots,p(n))$ is a permutation of $\\{1,2,\\cdots,n\\}$ using at most $O(1)$ space. Kirshenhofer, Prodinger and Tichy have shown that the major cost incurred in the algorithm satisfies a recurrence similar to sequence of the number of key comparisons needed by the Quicksort algorithm to sort an array of $n$ randomly permuted items. Further, Hwang has proved that the normalized cost converges in distribution. Here, following Neininger and R\\\"uschendorf, we prove the tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04784","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}