For example, if the input text is 'orange' and you enter a group size of 2, then you'll get three double-letter units: 'or', 'an', 'ge'. With the letter grouping option, you can combine several letters into a group and move them as a whole unit.
The Fisher and Yates' method rearranges each letter individually but you can also move more than one letter at a time. For a string of 'n' letters, there are 1×2×3×…×(n-1)×n (n factorial) possible unique letter permutations. This algorithm generates random permutations of finite sets of characters with the same probability distribution. It uses the Fisher-Yates-Knuth shuffling algorithm to do the job. This tool rearranges all letters in the given string, word, sentence, or text.
