Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6620
Title: Developing a Linear Algorithm for Cubing a Cyclic Permutation
Authors: Xue, Jinyun
Gries, David
Keywords: computer science
technical report
Issue Date: Sep-1986
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-780
Abstract: A linear algorithm is developed for cubing a cyclic permutation stored as a function in an array. This continues work discussed in [0] and [1] on searching for disciplined methods for developing and describing algorithms that deal with complicated data structures such as linked lists. Here, a different representation of a cyclic permutation reveals a simple algorithm; then, an equally simple coordinate transformation is used to yield the final algorithm.
URI: http://hdl.handle.net/1813/6620
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-780.pdf363.08 kBAdobe PDFView/Open
86-780.ps119.37 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us