void sort(int a,int n) int i,j,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] W/a[j+1]a[j] (tmp a[j];a[]a[j+1];a[j+1]=tmp;flag true;} if(!flag)break;*一趟冒泡中没有发生交换，排序结束*/ cout <endl; for (i=0;i<n;++i)cout <a[i]<'' 子 LoCCSvoid sort(int a[], int n) { int i, j, 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] ) //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] << ' '; }