第九章 指针 【SEARCH】



例9.9
//函数指针实现一个通用的排序函数
#include <stdio.h>
#include <stdlib.h>
#define N 40
int readscore(int score[]);
void printscore(int score[],int n);
void selectsort(int a[],int n,int (*compare)(int a,int b));
int ascending(int a,int b);
int descending(int a,int b);
void swap(int *x,int *y);

int main()
{
    int score[N],n;
    int order;
    n=readscore(score);
    printf("total students are %d\n",n);
    printf("enter 1 to sort in ascending order,\n");
    printf("enter 2 to sort in descending order:");
    scanf("%d",&order);
    printf("data itens in original order\n");
    printscore(score,n);
    if(order==1)
    {
        selectsort(score,n,ascending);

    }
    else
    {
        selectsort(score,n,descending);
    }
    printscore(score,n);

    return 0;
}
int readscore(int score[])
{
    int i=-1;
    do{
        i++;
        printf("input score:");
        scanf("%d",&score[i]);
    }while(score[i]>=0);
    return i;
}
void printscore(int score[],int n)
{
  int i;
  for(i=0;i<n;i++)
    printf("%4d",score[i]);
    printf("\n");

}
void selectsort(int a[],int n,int (*compare)(int a,int b))
{
    int i,j,k;
    for(i=0;i<n-1;i++)
    {
        k=i;//必须有个k
        for(j=i+1;j<n;j++)
        {
            if((*compare)(a[k],a[j]))
            k=j;

        }
        if(k!=i)
        swap(&a[k],&a[i]);

    }
}
int ascending(int a,int b)
{
    return a>b;
}
int descending(int a,int b)
{
    return a<b;
}
void swap(int *x,int *y)
{
    int temp;
    temp=*x;
    *x=*y;
    *y=temp;

}