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.