I have an array such as A-B-C-D-E-F-G-H-I-J-K I want to rotate it N places to the right; for example, if N=3, the array should end I-J-K-A-B-C-D-E-F-G-H

Assume that the only available operation is a FLIP method that can invert any portion of the array. For example, applied to the original array FLIP(3,6) would produce A-B-F-E-D-C-G-H-I-J-K.

(In reply to Here is a program that compares the algorithms by Penny)

Penny, I salute you.

That is a monumental piece of programming, i wouldn't know where to start, I take off my hat to you.

Juggler.

Posted by Juggler on 2004-04-20 19:19:11