Thread: Sorting numbers in a file

>>quicksort(array, s);
You don't want to sort the whole array, only the elements that have real data in them, so use:
>>quicksort(array, i);

Change this bit:

Code:

while(array != NULL){      //Puts the numbers back into a new file
      for(n=0; n <101; n++){
          fprintf(quick, "%d\n", array[n]);
      }
    }

to this (note, no "while" loop needed)

Code:

for (n = 0; n < i; n++)
  {
    fprintf(quick, "%d\n", array[n]);
  }

Change this
>>for(b=a=1;b<size;b++){
to this
for (b = a; b < size; b++)

See how you go, that may not be all necessary changes, but it should get you moving.

For loop is not appropriate in this case.

Code:

for (i=0; fgets(buf,sizeof(buf),fp) && i < 101; i++){
  array[i]=atoi(buf);
}

Use this:

Code:

i = 0;
while (fgets(buf,sizeof(buf),fp) != EOF)
{
    array[i++]=atoi(buf);
}

>while (fgets(buf,sizeof(buf),fp) != EOF)
You probably meant NULL instead of EOF.

>For loop is not appropriate in this case.
Why not? It still counts a set number of times unless end of file is reached or an error occurs. If it makes you feel better then you can move fgets out of the loop condition to get something more idiomatic (albeit also more verbose):

Code:

for (i=0; i < 101; i++){
  if (fgets(buf,sizeof(buf),fp) == NULL)
    break;
  array[i]=atoi(buf);
}