Finding a 'Proper Subset'
Hi, I've been having trouble getting a piece of code I've made to find whether a set is a proper subset of another. The code I'm using is the following:
The problem is, when I run the program, the output always comes out False :( . Any help is appreciated.
bool contain(bool arrayA[letter],bool arrayB[letter])
if (arrayA[i]==arrayB[i]) counter++;
if (counter==26) return false;
if (arrayA[i]==true) (counter2++);
if ((counter==counter2)/*&&(counter!=0)*/) return (true);