qsort的使用

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


int  cmp1(const void *arr1,const void *arr2){


return (*(int  *)arr1 - *(int *)arr2);


}


int cmp2(const void *arr1, const void *arr2){


return (*(char   *)arr1 - *(char *)arr2);


}




int main(){
int  arr1[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
char arr2[] = {'a','q','w','t','u','i','p','k','b','n'};


int size1 = sizeof(arr1) / sizeof(arr1[0]);
int size2 = sizeof(arr2) / sizeof(arr2[0]);


qsort(arr1, size1, sizeof(int), cmp1);
qsort(arr2, size2, sizeof(char), cmp2);


for (int i = 0; i < size1; i++){
printf("%d", arr1[i]);
}
printf("\n");


for (int i = 0; i < size2; i++){
printf("%c", arr2[i]);
}


system("pause");
}

猜你喜欢

转载自blog.csdn.net/sd116460/article/details/80443850