4 ms·
There was a recent post about anagrams and the author just put all the letters in alphabetical order and then compared the words, which was more efficient than
by forinti 10y ago
There was a recent post about anagrams and the author just put all the letters in alphabetical order and then compared the words, which was more efficient than generating permutations.
- NegativeLatency 10y agoSounds interesting, do you have a link?
- forinti 10y agohttp://blog.plover.com/lang/anagram-scoring.html http://blog.plover.com/lang/anagram-scoring.html
- hfsktr 10y agoThat is what I did for this challenge: https://www.reddit.com/r/dailyprogrammer/comments/52enht/20160912_challenge_283_easy_anagram_detector/ https://www.reddit.com/r/dailyprogrammer/comments/52enht/201... https://github.com/Rhebel/DailyProgrammer/blob/master/DailyProgrammerCodes/Models/Challenge283E.cs https://github.com/Rhebel/DailyProgrammer/blob/master/DailyP... I know my code is super verbose compared to other people's but I'd rather be understood than clever.
- Johnny_Brahms 10y agoI ran an anagram website in the 90s, and that was what we did. We stored word lists with a key of all their letters sorted. We then calculated anagram scores on demand because I couldn't work out a nice enough way to store those. We had about 300 hits/day so it didn't matter.