'Computes the positional distance between two permutations.
Examples
>>> from sympy.combinatorics.permutations import Permutation
>>> p = Permutation([0, 3, 1, 2, 4])
>>> q = Permutation.josephus(4, 5, 2)
>>> r = Permutation([3, 1, 4, 0, 2])
>>> p.get_positional_distance(q)
12
>>> p.get_positional_distance(r)
12
See Also
get_precedence_distance, get_adjacency_distance'

def get_positional_distance(self, other):

    a = self.array_form
    b = other.array_form
    if (len(a) != len(b)):
        raise ValueError('The    permutations    must    be    of    the    same    size.')
    return sum([abs((a[i] - b[i])) for i in range(len(a))])
