On a Distance Function for Ordered Lists
- Author(s): Siklossy, Laurent
- et al.
Given two ordered lists of the same elements, we define their distance as the sum for each element of the absolute value of the difference of each element's position in the two lists. Various properties of this distance function are exhibited. In particular, a given list is "far", on the average, from a random list of the same elements.