Anagram Solving Algorithm

I debated uploading this for a while, but figured, "eh, why not?"

I give you ample time in the video to turn back, so take that warning seriously!

In this video, I describe an algorithm for creating a tree of combinations of characters of a given word. This tree can then be used to find all of the anagrams of a word.

I'm pretty sure some of the smaller print will not show up very well, so bear with it...if you want... :)

If there's something you want clarified in the video, go ahead and leave a comment!

Category:

Science & Technology

Tags:

• anagram
• solver
• algorithm
• word
• puzzle
• computer
• science
• C#
• java
• code
• coding
• data
• structures
• tree
• recursion
• powerpoint
• animations
• permutations
• combinations
• program
• programming
• educational

[gbjgfhbg]

hey bt urs has gt d problm of repetitions....:-X

[sanyarem]

@gbjgfhbg

Yes, you're absolutely right. When there are words with repeated letters, like butter, you will have to form 2 sub-trees with the letter t. In addition, in the sub tree of b, you get two sub-trees of bt. Yes, this algorithm is indeed inefficient. I'm pretty busy right now, but I plan on writing another algorithm that only finds whole anagrams (as this one finds partial anagrams, like eat is a partial anagram of team). I'll try and post a video on that one as well, but it may be a bit

[radleyholla71b]

I want this video on my W209 phone.

[billconner718]

This video went viral on Conakry

[jwm239]

...also the 'match word with binary numbers' technique...using strings of 0s and 1's, with each "1" meaning "include this letter," followed by the permutations of 1's and 0's. E.g.,

if "TEAM" is "1111", then 1110, 1101, 1011, 0111 could mean TEA, TEM, TAM, EAM, then transpose these substrings of 3 letters, etc.

[GOxTOxTOWNx]

wow thank for the help i never realy understood

[gbjgfhbg]

ur osm...u figurd dis out yourself??....:)

[GreatSlovakia]

Thanks for the vid :)