#include <iostream> using namespace std; int my_F( const void *a, const void *b ) { return ( *(int*)a - *(int*)b ); //如果a大于b则返回真,这样排序后的结果是升序的。 } int main(void) { int x[]={5,4,42,11,1234,45,77,3,2,1}; int len = sizeof(x)/sizeof(*x); int i; cout<<"排序前:"<<endl; for ( i=0; i<len; i++ ) { cout<<x[i]<<" "; } cout<<endl<<endl; qsort( (void*)x, len, sizeof(int), my_F ); cout<<"排序后:"<<endl; for ( i=0; i<len; i++ ) { cout<<x[i]<<" "; } cout<<endl; return 0; }