c++qsort排序函数

#include <iostream>
using namespace std;
int compasc(const void* p, const void* q) {
    return *((int*)p) - *((int*)q);
};
int compdesc(const void* p, const void* q) {
    return *((int*)q) - *((int*)p);
};
int main()
{
    cout << "顺序" << endl;
    int a[] = { 1,23,34,55,43,65,75,12,34 };
    qsort(a, sizeof(a) / sizeof(int), sizeof(int), compasc);
    for (int i = 0; i < sizeof(a)/sizeof(int); i++)
    {
        cout << a[i] << endl;
    }
    cout << "倒序"<<endl;
    qsort(a, sizeof(a) / sizeof(int), sizeof(int), compdesc);
    for (int i = 0; i < sizeof(a) / sizeof(int); i++)
    {
        cout << a[i] << endl;
    }
}