Go backward to Permutations Go up to Top Go forward to |
t is permutation of s : <=> let n = length(t): n = length(s) /\ exists p: p is permutation of length n /\ p o s = t; t is sorted with respect to <= : <=> forall 0 <= i < length(t)-1: ti <= ti+1.