0
Most times a loop
Given an array of length n, each two element of which are different, rearrange it in a same method of swapping (the destination is only effected by the source place, not the value, e.g. [a1, a2, a3] => [a3, a1, a2]) till it's the same as original. How many times it swap at most...