A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem

DOI10.1093/COMJNL/31.6.557MaRDI QIDQ3813305zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1988

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/31.6.557

zbMATH Keywords

reshufflingsmoothsort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Efficient algorithms for sorting k-sets in bins
• Sorting shuffled monotone sequences
• Sorting by bounded block-moves
• The towers of Antwerpen problem
• Algorithms – ESA 2005

This page was built for publication: A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813305)