DO NOT GIVE ME THE CODE BELOW THAT WAS ALREADY ANSWERED IN ASIMILAR QUESTION!!!!! AND DO NOT USE ANY FOR LOOPS OR WHILE LOOPSOR ANY STL ALGORITHMS!!!!
#include
#include
#define MAXDICTWORDS 10
#define MAXRESULTS 10
using namespace std;
int readDictionary(ifstream &dictfile, string dict[]);
int recursivePermute(string word, const string dict[], int n,string results[]);
void recurPrint(const string results[], int sz);
int checkAZero(int a[], int n);
int match(const string dictWord, int a[], unsigned int n);
void buildA(int a[], unsigned int n, const string word);
int main(){
ifstream dictfile(“words.txt”);
string dict[MAXDICTWORDS], word, results[MAXRESULTS];
cout << “Please enter a string for an anagram: “;
cin >> word;
int n = readDictionary(dictfile, dict);
int sz = recursivePermute(word, dict, n, results);
recurPrint(results, sz);
return 0;
}
int readDictionary(ifstream &dictfile,
PayPal Gateway not configured
PayPal Gateway not configured