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 re: 10 step method by SilverKnight)

Sorry about that.  This is as far as my "algorithm" knowledge goes.  I had no clue about the M-1 thing or the N x (M-N) (you explained that a reply to Penny's solution).  

Posted by logischer Verstand on 2004-04-19 18:17:45