Two words are anagrams if the letters in the one are the letters in the other modulo rearrangement. For instance "tap" and "pat" are anagrams.
This program finds all of them in the input, including duplicated words, and not worrying about case.
In reply to RE (tilly) 1: Find anagrams
by tilly
in thread Find anagrams
by tilly
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |