previous Menunext

Permutation

Functionality and example

A Permutation (from the latin word permutare "to (inter)change") means a change of the sequence from elements of a string. In mathematical terms a permutation is a bijective self-mapping of a usually finite set. Colloquially the term is also used as a synoynm for "Placement".

A Permutation of the string "ABC" results in "ABC ACB BAC BCA CAB CBA".

A special case of Permutations are Anagrams, where the Permutation result of a known word is again a known word. For example the word "EVIL" is an anagram of "VILE".

Source: http://en.wikipedia.org/wiki/Permutation

Operation



Input
  1. String, from which the permutation shall be calculated.
  2. Click!
Output
List of permutations and count of possible combinations