Anonymous user
Anagrams: Difference between revisions
added Ursala
No edit summary |
(added Ursala) |
||
Line 468:
angel angle galen glean lange
alger glare lager large regal</pre>
=={{header|Ursala}}==
Supplying the input file on the command line during compilation makes
its contents accessible as a pre-declared identifier. The algorithm
is to group the words together that are made from the same unordered lists of letters,
then collect the groups together that have the same number of words in
them, and then show the group associated with the highest number.
<lang Ursala>
#import std
#show+
anagrams = mat` * leql$^&h eql|=@rK2tFlSS ^(~&,-<&)* unixdict_dot_txt</lang>
output:
<pre>
evil levi live veil vile
caret carte cater crate trace
alger glare lager large regal
elan lane lean lena neal
angel angle galen glean lange
abel able bale bela elba</pre>
=={{header|Vedit macro language}}==
| |||