knr/5.7.c

   #include <stdio.h>
   #include <string.h>

   #define MAXLINES 5     /* max #lines to be sorted */

   char lineptr[MAXLINES];  /* pointers to text lines */

   int readlines(char *lineptr[], int maxlines, char lineary[MAXLINES][MAXLEN]);
   void writelines(char *lineptr[], int nlines);

   void qsort(char *lineptr[], int left, int right);
   #define MAXLEN 1000  /* max length of any input line */

   /* sort input lines */
   int main()
   {
       int nlines;     /* number of input lines read */
       char lines[MAXLINES][MAXLEN];
       
       if ((nlines = readlines(lineptr, MAXLINES, lines)) >= 0) {
           qsort(lineptr, 0, nlines-1);
           writelines(lineptr, nlines);
           return 0;
       } else {
           printf("error: input too big to sort\n");
           return 1;
       }
   }

   int getfine(char* s, int maxline);

   /* getline:  read a line into s, return length  */
   int getfine(char* s, int maxline)
   {
       int c, i;
       for (i=0; ((c=getchar())!=EOF) && c!='\n'; i++)
       {
           *s = c;
           s++;
       }
       if (c == '\n')
       {
           *s = c;
           ++i;
       }
       return i;
   }

   /* readlines:  read input lines */
   int readlines(char *lineptr[], int maxlines, char lineary[MAXLINES][MAXLEN])
   {
     int len=1; //start
     int i=0;
     for (; len>0 && i<MAXLINES; i++)
       {
         len = getfine(lineary[i], MAXLEN);
         line[len-1] = '\0';  /* delete newline */
         lineptr[i] = line ;
       }
     return i;
   }

   /* writelines:  write output lines */
   void writelines(char *lineptr[], int nlines)
   {
       while (nlines-- > 0)
           printf("%s\n", *lineptr++);
   }

   /* qsort:  sort v[left]...v[right] into increasing order */
   void qsort(char *v[], int left, int right)
   {
       int i, last;
       void swap(char *v[], int i, int j);

       if (left >= right)  /* do nothing if array contains */
           return;         /* fewer than two elements */
       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);
   }

   /* swap:  interchange v[i] and v[j] */
   void swap(char *v[], int i, int j)
   {
       char *temp;

       temp = v[i];
       v[i] = v[j];
       v[j] = temp;
   }