指针数组和指向指针的指针

这是C BIBLE书籍中的有关这一主题的代码。解决的是对于输入的字符串进行排序重新输出的问题。排序的依据是字母的顺序，如将asdc,排序后为acds。

—————————————————————————————————————————————————————————————————————————————

qsor.h

int readlines(char *lineptr[], int maxlines);
void writelines(char *lineptr[], int nlines);
void qsort(char *v[],int left,int right);

____________________________________________________________________________________________________________________________________

main.c

#include<stdio.h>
#include<string.h>
#include"qsort.h"
#define MAXLINES 5000


char *lineptr[MAXLINES];


/*sort input lines*/
main()
{
int nlines;/*number of input lines read */

if((nlines = readlines(lineptr, MAXLINES)) >= 0){
qsort(lineptr, 0, nlines -1);
writelines(lineptr,nlines);
return 0;
}else{
printf("error:input too big to sort\n");
return 1;
}
}

__________________________________________________________________________________________________________________________________

readlines.c

#include"qsort.h"
#include<stddef.h>
#define MAXLEN 1000


int getlines(char *,int);
char *alloc(int);


/*readlines:read input lines*/
int readlines(char *lineptr[], int maxlines)
{
    int len,nlines;
    char *p,line[MAXLEN];
    
    nlines = 0;
    while((len = getlines(line,MAXLEN)) >= 0)
        if(nlines >= maxlines || (p = alloc(len)) == NULL)
            return -1;
        else{
            line[len -1] ='\0';
            strcpy(p,line);
            lineptr[nlines ++] = p;
        }
   return nlines;
}

/*note : this function for  allocte storage and free if*/
#define ALLOCSIZE 10000   /*size of available space*/


static char allocbuf[ALLOCSIZE];  /*storage for alloc*/
static char *allocp = allocbuf;   /*next free position*/


char *alloc(int n)  /*return pointer to n characters*/
{
    if(allocbuf + ALLOCSIZE -allocp >= n){
        allocp += n;
        return allocp -n;    /*old p*/
    }else    /*not enough room*/
        return 0;
}
void afree(char *p)  /*free storage pointed to by p */
{
    if(p >= allocbuf && p < allocbuf+ ALLOCSIZE)
        allocp = p;
}

____________________________________________________________________________________________________________________________________

wirtelines.c

#include"qsort.h"


void writelines(char *lineptr[],int nlines)
{
    int i;
    
    for(i = 0;i< nlines;i++)
        printf("%s\n",lineptr[i]);
}

____________________________________________________________________________________________________________________________________

qsort.c

#include<stdio.h>
#include"qsort.h"


/*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);
}


void swap(char *v[], int i,int j)
{
    char *temp;
    
    temp = v[i];
    v[i] = v[j];
    v[j] = temp;
}

__________________________________________________________________________________________________________________________________