Quantcast
Channel: Algorithm for finding amount of word anagrams? - Stack Overflow
Browsing all 4 articles
Browse latest View live

Answer by JRazek for Algorithm for finding amount of word anagrams?

You can use some combinatorics. First you count number of occurrences of each character. Then with newtons symbol you emplace every character on its places. for example given wordaabcdeeyou have 7...

View Article


Answer by pullidea-dev for Algorithm for finding amount of word anagrams?

Code:package mainimport ("bufio""fmt""os""strings")func main() { scanner := bufio.NewScanner(os.Stdin) fmt.Print("Enter word: ") scanner.Scan() word := scanner.Text() anagrams := factorial(len(word))...

View Article


Answer by Hymns For Disco for Algorithm for finding amount of word anagrams?

If the validity of the words is not considered whatsoever, then probably best to ditch the word "anagram". You're simply asking about permutations. There is a formula for permutations that accounts for...

View Article

Algorithm for finding amount of word anagrams?

So I know the theory behind finding anagrams, shown here. For my purposes I need to find the amount of anagrams that can be found from a word excluding duplicates.Allowing for duplicates, this is...

View Article
Browsing all 4 articles
Browse latest View live


Latest Images