A cyclic permutation of length n is a permutation that shifts each element one position to the right (or left) in a cycle. For example, the cyclic permutation (1 2 3 4 5) maps 1 to 2, 2 to 3, 3 to 4, 4 to 5, and 5 to 1.
The order of a cyclic permutation of length n is n, because it takes n applications of the permutation to return to the original arrangement.