Hi, I need to write a recursive function in MATLAB that would do exactly what the perm() function does. I would input a string and the function would output all the possible anagrams of that string, in the same order that s=perm('matlab'), output = s(end:-1:1,:) would be in.

For the simple string 'abc', the permutation list would read {'abc', 'acb', 'bac', 'bca', 'cab', 'cba'}. The function should work for any combination of letters in a string.