int main(int argc, char *argv[])
{
    char phrase1[500], phrase2[500];
    cout << "Enter the first string" << endl;
    cin.getline (phrase1, 500);
    cout << "Enter the second string" << endl;
    cin.getline (phrase2, 500);
    
  char LowAlphList[] = {"abcdefghijklmnopqrstuvwxyz"};
  char UpAlphList[] = {"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
  
  int alphCount1[26];
  int alphCount2[26];
  
  int count = 0;
  int count2 = 1;
  for(int i =0; i<26; i++){
          for(int j =0; j<500; j++){
                  if((phrase1[j] == LowAlphList[i]) || (phrase1[j] == UpAlphList[i])){
                            alphCount1[count] =  count2;
                           count2++;
                  }
          }
          count2=0;
          count++;

  }

  int Count = 0;
  int Count2 = 1;
  for(int i =0; i<26; i++){
          for(int j =0; j<500; j++){
                  if((phrase2[j] == LowAlphList[i]) || (phrase2[j] == UpAlphList[i])){
                           alphCount2[Count] =  Count2;
                           Count2++;
                  }
          }
          Count2=0;
          Count++;

cout << alphCount1 << endl << alphCount2 << endl;

  }                            
  int counter =0;
  for(int i=0; i <26; i++){
      if(alphCount1[i]=alphCount2[i]){
         counter=counter;
      }
      else{
         counter++;
      }

  if(counter == 0){
     cout << "Phrases are anagrams" << endl;
  }
  else{
     cout << "Phrases are not anagrams" << endl;
  }
            
    
  system("PAUSE");
  return EXIT_SUCCESS;
}

#include <iostream>
using namespace std;

int main(int argc, char *argv[])
{
    char phrase1[500], phrase2[500];
    cout << "Enter the first string" << endl;
    cin.getline (phrase1, 500);
    cout << "Enter the second string" << endl;
    cin.getline (phrase2, 500);
    
    char LowAlphList[] = {"abcdefghijklmnopqrstuvwxyz"};
    char UpAlphList[] = {"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};

    // Set our arrays to zero all the way through
    int alphCount1[26] = {0};
    int alphCount2[26] = {0};

    // Get the length of each phrase
    int count = (int)strlen(phrase1);
    int count2 = (int)strlen(phrase2);

    // If they are not identical length, we automatically know they are not anagrams.
    if (count == count2) {

        // Loop through the letters of each phrase (which are identical)
        for (int i = 0; i < count; i++) {

            // Loop through the alphabet for both phrases simulatneously
            // Increment their respective spots in their own array
            // They are in sync, like it?;)
            for (int j = 0; j < 26; j++) {
                if ((phrase1[i] == LowAlphList[j]) || (phrase1[i] == UpAlphList[j])) {
                    alphCount1[j] += 1;
                }

                if ((phrase2[i] == LowAlphList[j]) || (phrase2[i] == UpAlphList[j])) {
                    alphCount2[j] += 1;
                }
            }
        }

        bool identical = true;

        // Last, compare the two arrays to see if they have the same counts.
        for (int i = 0; i < 26; i++) {
            if (alphCount1[i] != alphCount2[i]) {
                identical = false;
            }
        }

        // If the arrays have the same count, identical flag would not be set to false.
        if (identical) { cout << "They are anagrams" << endl; }
        else { cout << "They are not anagrams" << endl; }
    }
    else { cout << "They are not anagrams" << endl; }

    system("PAUSE");
    return 0;
}