qsort

[coder222]

How is this sort function supposed to work?

void qsort(char *v[], int i, int j);


{
   
   int i, last;
   void swap(char *v[], int i, int j);
   
   if (left >= right)                     
   return;                               


    swap(v, left, (left + right)/2);
    last = left;
    for (i = left+1; i<= right; i++)
         if (strcmp(v[i], v[left]) < 0)
         swap(v, ++last, i);
    swap(v, left, last);
    qsort(v, left, last-1)
    qsort(v, last+1, right);


}

[laserlight]

It looks intended to sort an array of pointers to char, each of which points to the first character of a null terminated string. The algorithm itself looks like an implementation of quicksort.

By the way, avoid the name qsort as it is the name of a function from the standard library.

[coder222]

I don't understand the algorithm. How is it supposed to work.

[laserlight]

I don't understand the algorithm. How is it supposed to work.

I suggest that you read up on quicksort and try out examples yourself.