i have no idea why this does not work
I am making a program that will analize text and determine if it is an anagram.
all the inputs are working, but
Code:
compareOccurences();
always returns true.
please help.
thanks in advance.
p.s. i am relatively new to c++, so sorry if it is a stupid mistake
Code:
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int listOfOccurence [28];
int listOfOccurence2 [28];
char plainText [500];
char anagram [500];
void getOccurences ()
{
int count=0;
while (count < 500)
{
switch (anagram[count])
{
case 'a'|'A':
{
listOfOccurence[1]+=1;
break;
}
case 'b'|'B':
{
listOfOccurence[2]+=1;
break;
}
case 'c'|'C':
{
listOfOccurence[3]+=1;
break;
}
case 'd'|'D':
{
listOfOccurence[4]+=1;
break;
}
case 'e'|'E':
{
listOfOccurence[5]+=1;
break;
}
case 'f'|'F':
{
listOfOccurence[6]+=1;
break;
}
case 'g'|'G':
{
listOfOccurence[7]+=1;
break;
}
case 'h'|'H':
{
listOfOccurence[8]+=1;
break;
}
case'i'|'I':
{
listOfOccurence[9]+=1;
break;
}
case'j'|'J':
{
listOfOccurence[10]+=1;
break;
}
case'k'|'K':
{
listOfOccurence[11]+=1;
break;
}
case'l'|'L':
{
listOfOccurence[12]+=1;
break;
}
case'm'|'M':
{
listOfOccurence[13]+=1;
break;
}
case'n'|'N':
{
listOfOccurence[14]+=1;
break;
}
case'o'|'O':
{
listOfOccurence[15]+=1;
break;
}
case'p'|'P':
{
listOfOccurence[16]+=1;
break;
}
case'q'|'Q':
{
listOfOccurence[17]+=1;
break;
}
case'r'|'R':
{
listOfOccurence[18]+=1;
break;
}
case's'|'S':
{
listOfOccurence[19]+=1;
break;
}
case't'|'T':
{
listOfOccurence[20]+=1;
break;
}
case'u'|'U':
{
listOfOccurence[21]+=1;
break;
}
case'v'|'V':
{
listOfOccurence[22]+=1;
break;
}
case'w'|'W':
{
listOfOccurence[23]+=1;
break;
}
case'x'|'X':
{
listOfOccurence[24]+=1;
break;
}
case'y'|'Y':
{
listOfOccurence[25]+=1;
break;
}
case'z'|'Z':
{
listOfOccurence[26]+=1;
break;
}
case' ':
{
listOfOccurence[27]+=1;
break;
}
}
count ++;
}
count =0;
while (count <500)
{
switch (anagram[count])
{
case 'a'|'A':
{
listOfOccurence2[1]+=1;
break;
}
case 'b'|'B':
{
listOfOccurence2[2]+=1;
break;
}
case 'c'|'C':
{
listOfOccurence2[3]+=1;
break;
}
case 'd'|'D':
{
listOfOccurence2[4]+=1;
break;
}
case 'e'|'E':
{
listOfOccurence2[5]+=1;
break;
}
case 'f'|'F':
{
listOfOccurence2[6]+=1;
break;
}
case 'g'|'G':
{
listOfOccurence2[7]+=1;
break;
}
case 'h'|'H':
{
listOfOccurence2[8]+=1;
break;
}
case'i'|'I':
{
listOfOccurence2[9]+=1;
break;
}
case'j'|'J':
{
listOfOccurence2[10]+=1;
break;
}
case'k'|'K':
{
listOfOccurence2[11]+=1;
break;
}
case'l'|'L':
{
listOfOccurence2[12]+=1;
break;
}
case'm'|'M':
{
listOfOccurence2[13]+=1;
break;
}
case'n'|'N':
{
listOfOccurence2[14]+=1;
break;
}
case'o'|'O':
{
listOfOccurence2[15]+=1;
break;
}
case'p'|'P':
{
listOfOccurence2[16]+=1;
break;
}
case'q'|'Q':
{
listOfOccurence2[17]+=1;
break;
}
case'r'|'R':
{
listOfOccurence2[18]+=1;
break;
}
case's'|'S':
{
listOfOccurence2[19]+=1;
break;
}
case't'|'T':
{
listOfOccurence2[20]+=1;
break;
}
case'u'|'U':
{
listOfOccurence2[21]+=1;
break;
}
case'v'|'V':
{
listOfOccurence2[22]+=1;
break;
}
case'w'|'W':
{
listOfOccurence2[23]+=1;
break;
}
case'x'|'X':
{
listOfOccurence2[24]+=1;
break;
}
case'y'|'Y':
{
listOfOccurence2[25]+=1;
break;
}
case'z'|'Z':
{
listOfOccurence2[26]+=1;
break;
}
case' ':
{
listOfOccurence2[27]+=1;
break;
}
}
count ++;
}
}
bool compareOccurences()
{
int a;
while (a<28)
{
if(listOfOccurence[a]==listOfOccurence2[a])
a++;
else if(listOfOccurence[a]!=listOfOccurence2[a])
return false;
}
}
int main(int argc, char *argv[])
{
cout<<"Please enter the anagram, including spaces: \n";
cin.getline(anagram, 500);
cout<<"Pleaase enter the plain text, including spaces: \n";
cin.getline(plainText, 500);
getOccurences();
if(compareOccurences)
cout<<"The text you have entered is an anagram\n";
system("PAUSE");
return EXIT_SUCCESS;
}
