qsort的另类玩法,无聊写着耍耍

#include <stdio.h>
#include <stdlib.h>
char cmp_shellcode[] = "x55"
"x89xe5"
"x8bx4dx08"
"x8bx45x0c"
"x8bx10"
"x8bx01"
"x29xd0"
"x5d"
"xc3";
int main(n)
{
int a = 2, b = 5;
int data1[10] = {2,3,4,67,32,25,63,23,64,88};
int data2[10] = {43,15,42,13,44,24,54,33,1,10};
// printf("%d ",( (int (*)(int *, int *)) &cmp_shellcode )(&a,&b));

qsort(data1, 10, sizeof(int),(int (*)(int *, int *))&cmp_shellcode);
qsort(data2, 10, sizeof(int),"YXZQQQx8bx00+x02xc3");

for(n = 0; n < 10; printf("%d ", data1[n]), n++);
puts("");
for(n = 0; n < 10; printf("%d ", data2[n]), n++);

return 0;
}

原文地址:https://www.cnblogs.com/foohack/p/3723367.html