HackerPapers

arXiv:0805.1598cs.DS

A Simple In-Place Algorithm for In-Shuffle

Peiyush Jain

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The paper presents a simple, linear time, in-place algorithm for performing a 2-way in-shuffle which can be used with little modification for certain other k-way shuffles.

arXiv comments
3 pages
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Mar 2022 to Mar 2022.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. In-place merge algorithm using up to O(n+m) swaps and no temp swap space 1 comment

    • If the arrays are in one contiguous block, I think this is equivalent to a 2-way shuffle in place, here's a neat paper on it: https://arxiv.org/pdf/0805.1598.pdf

      dupedView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.