软件工程冒泡法排序.doc

#include #include #include #define N 50void main( )int i,j,m,t;int aN=0;srand( (unsigned)time( NULL ) ); for( i = 0; i aj+1) t=aj;aj=aj+1;aj+1=t;printf(“排序后为:n“);for(i=0;iN;i+)printf(“%dn“,ai);/sort();/printf(“排序后为:n“);/ for(x=0;xN;x+)/printf(“%dn“,ax);