A recursive function that generates a list of all possible anagrams for a given string.

Recursive-Anagram-Generator.py

def anagram_generator(string):
    """
    A recursive function that generates a list of all possible anagrams for a given string.
    """
    list = []
    # The last char in our string will be inserted at every index in order to generate sub-anagrams.
    insert_char = string[len(string)-1]
    
    # Base Case: if string is only 1 character.
    if len(string) <= 1: 
        return [string[0]]
    
    # Inductive Step:
    for sub_anagram in anagram_generator(string[:-1]): # for a sub-anagram in of list of sub-anagrams.
        for index in range(len(sub_anagram) + 1): # We loop one extra over so we can assign our insert letter at the first element
            list.append(sub_anagram[:index] + insert_char + sub_anagram[index:])
    
    return list
    
print(anagram_generator("abcdefg"))