distancePermutationLex {CEGO} | R Documentation |

## Lexicographic permutation distance

### Description

This function calculates the lexicographic permutation distance. That is the difference of positions that both positions would receive in a lexicographic ordering. Note, that this distance measure can quickly become inaccurate if the length of the permutations grows too large, due to being based on the factorial of the length. In general, permutations longer than 100 elements should be avoided.

### Usage

```
distancePermutationLex(x, y)
```

### Arguments

`x` |
first permutation (integer vector) |

`y` |
second permutation (integer vector) |

### Value

numeric distance value

`d(x,y)`

, scaled to values between 0 and 1 (based on the maximum possible distance between two permutations)

### See Also

`lexicographicPermutationOrderNumber`

### Examples

```
x <- 1:5
y <- c(1,2,3,5,4)
distancePermutationLex(x,y)
p <- replicate(10,sample(1:5),simplify=FALSE)
distanceMatrix(p,distancePermutationLex)
```

[Package

*CEGO*version 2.4.3 Index]