Qsort快速排序

#include <stdio.h>
#include <stdlib.h>
int MyCompare( const void *elem1,const void *elem2){
    unsigned int *p1,*p2;
    p1 = (unsigned int *) elem1; //强制类型转换
    p2 = (unsigned int *) elem2;
    return (*p1%10) - (*p2%10) ;
}
#define NUM 5
int main(){
    int i;
    unsigned int an[NUM] = {8,123,11,10,4};
    qsort(an,NUM,sizeof(unsigned int),MyCompare);
    for(i = 0;i<NUM;i++)
        printf("%d\n",an[i]);
    return 0;
}