C++ qsort 快排函数使用示例.
#include
<
iostream
>
#include < algorithm >
#include < functional >
using namespace std;
int cmp ( const void * A, const void * B)
... {
return (*(int*)A) - (*(int*)B);
}
void main()
... {
int array[] = ...{72,6,57,88,85,42,83,73,48,60};
qsort((void *)array,(size_t)10,sizeof(int),cmp);
for(int i = 0; i< 10;++i)
cout << array[i] << ' ';
cout << endl;
}
#include < algorithm >
#include < functional >
using namespace std;
int cmp ( const void * A, const void * B)
... {
return (*(int*)A) - (*(int*)B);
}
void main()
... {
int array[] = ...{72,6,57,88,85,42,83,73,48,60};
qsort((void *)array,(size_t)10,sizeof(int),cmp);
for(int i = 0; i< 10;++i)
cout << array[i] << ' ';
cout << endl;
}