Go backward to Size of Powersets Go up to Top Go forward to Example: Sorting Problem

Permutations

Definition: A permutation of length n is a bijection from N_n to N_n:

p is permutation of length n : <=> p: N_n ->^bijective N_n.

Example: Take the sequence s = [a, b, c, d, e] and the permutation p=[1,0,4,3,2]. Then we have

p o s = [b, a, e, d, c].

Further results: see lecture notes.