#define _CRT_SECURE_NO_WARNINGS 1

//void qsort(void* base, 
//           size_t num,
//            size_t size,
//            int (*compar)(const void*, const void*));
//模拟实现qsort函数
#include<stdio.h>
//int main()
//{
// int arr[] = { 9,8,7,6,5,4,3,2,1,0 };
// int i = 0;
// int sz = sizeof(arr) / sizeof(arr[0]);
// for (i = 0; i < sz-1; i++)
// {
//  int j = 0;
//  for (j = 0; j < sz - 1 - i; j++)
//  {
//   if (arr[j] > arr[j + 1])
//   {
//    int tmp = arr[j];
//    arr[j] = arr[j + 1];
//    arr[j + 1] = tmp;
//   }
//  }
// }
// for (i = 0; i < sz; i++)
// {
//  printf("%d ", arr[i]);
// }
// return 0;
//}

struct student
{
    char name[20];
    int age;
};
void swap(char* buf1, char* buf2, int size)
{
    int i = 0;
    char tmp = 0;
    for (i = 0; i < size; i++)
    {
        tmp = *buf1;
        *buf1 = *buf2;
        *buf2 = tmp;
        buf1++;
        buf2++;
    }
}

void my_qsort(void* base, int num, int size, int(*cmp)(const void*, const void*))
{
    int i = 0;
    for (i = 0; i < num - 1; i++)
    {
        int j = 0;
        for (j = 0; j < num - 1 - i; j++)
        {
            if ((cmp((char*)base + j * size, (char*)base + (j + 1) * size)) > 0)//比较部分需要根据需求更换
            {
                //交换部分需要根据需求更换
                swap((char*)base + j * size, (char*)base + (j + 1) * size, size);
            }
        }
    }
}

int cmp_int(const void* p1, const void* p2)
{
    return *(int*)p1 - *(int*)p2;
}

int cmp_by_age(const void* p1, const void* p2)
{
    return ((struct student*)p1)->age - ((struct student*)p2)->age;
}

void test1()
{
    int i = 0;
    int arr[] = { 9,8,7,6,5,4,3,2,1,0 };
    int size = sizeof(arr) / sizeof(arr[0]);
    my_qsort(arr, size, sizeof(int), cmp_int);
    for (i = 0; i < size; i++)
    {
        printf("%d ", arr[i]);

    }
}

void test2()
{
    struct student s1[3] = { {"zhangsan",80},{"lisi",75},{"wangwu",45} };
    int num = sizeof(s1) / sizeof(s1[0]);

    my_qsort(s1, num, sizeof(struct student), cmp_by_age);

}
int main()
{
    //test1();
    //test2();
    return 0;

}