...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.
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
I want this video on my W209 phone.
radleyholla71b 4 weeks ago
This video went viral on Conakry
billconner718 2 months ago
...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.
jwm239 3 months ago
wow thank for the help i never realy understood
GOxTOxTOWNx 10 months ago
hey bt urs has gt d problm of repetitions....:-X
gbjgfhbg 11 months ago
@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
sanyarem 11 months ago
ur osm...u figurd dis out yourself??....:)
gbjgfhbg 1 year ago
Thanks for the vid :)
GreatSlovakia 1 year ago