Simple reading file issue with array?

Question

I am working on a project for a basic programming class and am not entirely familiar with strings and all. The goal of the program is to take one simple text file with a few random, repeated words, and return a file with each separate word and the number of times it appears in the file. The input file looks something like

Class
Text
Class
fall
mark
mark
Text

and the output should read,

Class 2
Text 2
fall 1
mark 2

I am having trouble reading and setting up an array for the input data. Not sure exactly how to set it up. Any suggestions would be great.

int main(void)
{
int k=0, p=0, words=0, match=0, ch=0;
double xx;
char I[WORD][LETTER; 

FILE *file;
file = fopen("C:\\Users\\Andrew\\Documents\\te2.txt", "r");

if(file != NULL){

// Count the amount of words in file set up array   
int i=0, j=0;
for(i=0; i<WORD; i++){
        for(j=0; j<LETTER; j++){
    fscanf(file, "%s", &I[i][j]);
    ch++;
     }}

Answer 1

What you are trying to do is really quite simple. Lets break it down:

1. Read in each word in a file.
2. Store it in something that recognises individual words and can increment a number (a std::map).
3. Print out the result.

---

Part 1 - Read each word

Lets read in a file word by word. Searching read in a file word by word c++ would have sufficed but here is a short example:

ifstream file; // A in file stream, the c++ way of reading files. 
file.open ("example.txt");
string word; // A word to store each word. 

// Read each word. 
while ( file >> word) {
    // Do something with your word. (Part 2)
}

Its as easy as that!

---

Part 2 - Store them in a map

Now we want to have a map, this is because a map will store only unique words and we can use its value to count the number of each unique word. Read about maps here. We need a string as the key and an int to count the words, so:

std::map<std::string, int> myWords;

To put them in, we need to check if the word already exists, otherwise we set it to one:

// See if the map already contains the word (not only is this easy, it is also very efficient!)
// If we dont contain the word then we get an iterator to past the end of the map. 
if (myWords.find(word) == myWords.end()) {
    myWords[word] = 1; // If our map doesn't already have this word 
                       // we have encountered our first!
} else {
    myWords[word]++; // The map already has the word so just increment it. 
} 

Part 3 - Print them out

The easy part, simply iterate over the map and print them out:

for (auto wordPair : myWords) {
    std::cout << wordPair.first << " " << wordPair.second << std::endl;
}

---

Put it all together

And you get this:

http://ideone.com/TCMOKh

Answer 2

So I have been working on it and I came up with the idea to have the data come in character by character withfscanf(file, "%c", &array[]);and i have been working on an algorithm to set a certain amount of the characters before a '\n' into a smaller array to use it tom compare to the full string. in the file i have added spaces to any word that was a few characters so that the "word sizes are all the same with the spaces, the arrays are successful just having some issues witht the algorithm itself. `

#include <stdio.h>
#include <cctype>
#define Words 9
#define Letters 6
#define CHARACT Words*Letters
#define CORRECT 3

int main(void){

double xx;
int match=0, indx=0, i=0, k=0, j=0, b, read=0, r, t, track=0;
char shrt[Letters],  Long[CHARACT], c;


FILE *file;
file =fopen("C:\\Users\\Andrew\\Documents\\te2.txt", "r");
if(file != NULL)
{
    // initialize long string (full file by characters)
    for(k=0; k<CHARACT; k++)
        {
        fscanf(file, "%c", &Long[k]);
        }

    // set up shrt[] to compare to rest of array
    while(track <= CHARACT)
    {
    indx+=track;
        //STEP 1: take shrt[] out of Long[] for comparisons
        for(r=0; r<Letters; r++)
            {
                shrt[r] = Long[indx];
                indx++;
                if(shrt[r] == '\n')
                    break;
            }

        for(t=0; t<CHARACT; t++)
        {
            match=0;
            int VV = track*Letters;
                // STEP 2: keep shrt[] constant, compare to full string one by one 
                for(int p=0; p<Letters-2; p++)
                {
                    if(shrt[p] == Long[VV])
                        {
                            match++;
                        }
                }
            if(match >= CORRECT)
            {
                for(int ee=0; ee<Letters; ee++)
                {
                    printf("%c", shrt[ee]);
                }
                printf("  %i", match);
            }
            track+=Letters;
        }

    }// big for loop




    // TESTING TESTING
    printf("\n\n\nTEST\n\n");
    for(k=0; k<CHARACT; k++)                
        printf("%c", Long[k]);              // delete when ready
    printf("%i", read);

}// big if
else{
    printf("error");
}
    fclose(file);
    scanf("%f", &xx);
return 0;
}`