Given a finite alphabet (e.g. {A,B,C,...,Z}) how many different words can you create from these letters knowing that each letter can be used only once? This is just a typical problem of combinatorics and the answer it's quite simple: n!…
Finding the lexicographic order of permutations
