Question

Extra Credit Function Name: anagram Inputs: 1. 2. (char) String representing the anagram (char) Name of text file to write to Outputs: none File Outputs: 1. A text file containing all the permutations of the anagram Banned Functions: perms(), permute(), ipermute(), nchoosek (), combnk() Background: You guys know what do. You are professional MATLAB now, you got this! Function Description: Given a string, recursively determine all the unique ways to rearrange the letters. (i.e al the unique permutations). For example, if the string was 'abc', the list of permutations would be 'abc', 'acb', 'bac', 'bca', 'cab', 'cba. Write each permutation as a separate line in a text file, in alphabetical order. Case should be ignored and all letters should be lowercase in the output text file. Non-letter characters may occur in the string and should not be included. Characters may be repeated multiple times. There should be no newline character at the end of your file Notes: . Do not attempt to run this function with char vecs longer than about 10. If you do, you may be sitting around waiting a while The fourth test case will likely take a while, but all grading test cases will be shorter. » Hints: . The unique() function will be useful . You may need a wrapper function

Answer 1

Please find required MATLAB code along with necessary details in comments below:

--------------------------------------------------------- main_Script.m

clear all; clc;

str='pabc123'; % given string
filename='anagram.txt'; % file name where anagram have to be written
anagram(str,filename); % call the function

-------------------------------------------------------------------------- anagram.m

function anagram(str,filename)

% remove all the letters from the string
index = find(isletter(str));
fstr=str(index);
% convert all letters to lower case
fstr=lower(fstr);

% unique charcters in the string
unique_char=unique(fstr);
n=length(unique_char); % number of unique charcters in the string

% find all permulations of string
% all_comb=perms_letter(unique_char,n)
i=0;
for k=n:-1:1
i=i+1;
row_comb=[];
ntimes=n^(k-1);
for t=1:n^n/ntimes;
for j=1:n
% make all posssible combinations
row_comb=[row_comb;repmat(unique_char(j),ntimes,1)];
end
end
all_comb(:,i)=row_comb;
end

all_comb=cellstr(all_comb); % convert the chacter matrix into cell string

all_comb=unique(all_comb); % find unique strings from all combinations
all_comb=sort(all_comb); % sort strings in alphabetical order

fileId= fopen(filename,'w'); % open the file
fprintf(fileId,'%s\n',all_comb{:}); % write data to file
fclose(fileId); % close the file

========================================== SCREENSHOT OF CODE

=============================================== SAMPLE OUTPUT