How do you generate anagrams in alphabetical order in python?

Can be quite complex. Are there any further rules, e.g. just all possible permutations of a word or does the output have to be some other existing word or phrase? Sorry just re-read the post and found the answers.

what did you find?

Have a look here https://bitbucket.org/trebsirk/algorithms

Basically you could permutate the word as input and convert the data from the file as dict or list and check if the permutations are in the list, creating a new sorted list (will be alphabetical).

thanks for the tip Marco, confused about the link though

Look into the source codes, there are examples for permutations and anagram testing

Thanks a bunch dude