A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list into a one-to-one correspondence with itself. The number of permutations on a set of elements is given by ( factorial; Uspensky 1937, p. 18). For example, there are permutations of , namely and , and permutations of , namely , , , , , and . The permutations of a list can be found in
![Permutation -- from Wolfram MathWorld](https://cdn-ak-scissors.b.st-hatena.com/image/square/0e9d199124b73759f3b9521de077899dacaf484d/height=288;version=1;width=512/https%3A%2F%2Fmathworld.wolfram.com%2Fimages%2Fsocialmedia%2Fshare.png)