C中1M元素的结构数组

Question

I have the code bellow that is working the way I intended to work for a data relatively small say 10000 lines from a text file. I need it to work for a file with 1M lines. It gives seg fault and I don't know how to go around it. Can you help me?

This is called in main:

playersInfo player[size];

.......more code here

then for this part of program I have this code: (it reads a file and puts the info in the array then calculates the mvp of a player and prints the player with the highest mvp)

if(choice == 'D')
{
    printf("\n");
    while(i < size && fscanf(myFile, "%d %s %f %f %f %f %f %d %d %d \n", &player[i].id, player[i].name,
                    &player[i].ppg, &player[i].apg, &player[i].rpg, &player[i].spg, &player[i].mpg,
                    &player[i].vote1, &player[i].vote2, &player[i].vote3) != EOF)
    {
        player[i].mvp = 0;
        i++;
    }

    for(i = 0; i < size; i++)
    {
        int current = i;
        if(player[current].vote1 != player[current].id)
        {
            i = findIndex(player, size, player[current].vote1);
            player[i].mvp += 3;
        }

        if((player[current].vote2 != player[current].id) && (player[current].vote2 != player[current].vote1))
        {
            i = findIndex(player, size, player[current].vote2);
            player[i].mvp += 2;
        }
        if((player[current].vote3 != player[current].id) && (player[current].vote3 != player[current].vote1) && (player[current].vote3 != player[current].vote2))
        {
            i = findIndex(player, size, player[current].vote3);
            player[i].mvp += 1;
        }
        i = current;
    }

    qsort((void *) &player, size, sizeof(playersInfo), (compfn)comparePlayersByMVP);
    printf("The MVP is %s (%d), with %d point(s).\n", player[0].name, player[0].id, player[0].mvp);
}

Answer 1

If you are declaring your array in stack, then it may be too large for that. Consider using the heap.

playersInfo *player = (playersInfo*) malloc(size * sizeof(playersInfo));