A Simple In-Place Algorithm for In-Shuffle

Simple item page
dc.creatorJain, Peiyush
dc.date2008-05-12
dc.date.accessioned2026-07-07T09:38:19Z
dc.date.available2026-07-07T09:38:19Z
dc.descriptionThe 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.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/0805.1598
dc.identifierhttp://arxiv.org/abs/0805.1598
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160766
dc.subjectData Structures and Algorithms
dc.titleA Simple In-Place Algorithm for In-Shuffle
dc.typetext

Files

Collections

arXiv