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
10 step method by logischer Verstand)
logicscher's solution is "correct" in this specific case, but I think
the problem is asking for the general case with an offset of N and an
array of M elements. (In the problem, N=4, and M=11.)
Please show a general algorithm that solves it in no more than M-1 flips!
re: 10 step method
