int (*comp)(const void *const void *) void sort(User a[]int n,int (*comp)(const void *const void *) f int i,j; User tmp; bool flag; for (i=1;i<n;++i) {flag false; for (j=0;j<n-i;++j) if comp(&a[j+1],&a[]) {tmp a[];a[j]=a[j+1];a[j+1]tmp;flag true;} if(flag)break;一趟冒泡中没有发生交换，排序结束*！ cout <endl; for (i=0;i<n;++i)cout <a[i].name <'In'; 3 LoCCSint (*comp) (const void * , const void *); void sort(User a[ ], int n, int (*comp) (const void * , const void *)) { int i, j; User tmp; bool flag; for (i=1; i<n; ++i) {flag = false; for (j=0; j<n-i; ++j) if ( comp( &a[j+1], &a[j] )) {tmp = a[j]; a[j] = a[j+1]; a[j+1] = tmp; flag = true;} if (!flag) break;/* 一趟冒泡中没有发生交换，排序结束*/ } cout << endl; for (i=0; i<n; ++i) cout << a[i].name << '\n'; }