The number of "arrangements" in an ordering of items is given by either a combination (order is ignored) or a permutation (order is significant).
An ordering (or order) is also a method for choosing the order in which elements are placed (i.e., a sorting function).
The Wolfram Language function Ordering[p] gives the inverse permutation of a given permutation .