Skip Navigation

The Computer Journal 1988 31(6):557-560; doi:10.1093/comjnl/31.6.557
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Er, M. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem

M. C. Er *

Department of Computer Science, The University of Western Australia, Nedlands, WA 6009, Australia

This paper presents an efficient algorithm for solving the Bulterman's reshuffling problem in the spirit of smoothsort. The Bulterman's reshuffling problem is concerned with permuting an array of red and blue elements such that red elements are moved to specified positions without disturbing the relative order of blue elements. This smooth reshuffling algorithm solves the problem by utilising two processes, left sweep and right sweep; the latter is callable from the former. This algorithm is shown to be superior to a previously published algorithm which uses a brute force approach.

Received February 1987. revised March 1987.

* Now at Department of Maths and Computing Sciences, St Francis Xavier University, Antigonish, Nova Scotia, Canada B2G 1CO.

§ Department of Computer Science, The University of Western Australia, Nedlands, WA 6009, Australia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.