冒池排序(3) 8- 排序程序：P151-152 void SortProcedure(){ int pass,i,temp,exchangeCnt; for(pass=0;pass<DataArray.length;pass+){/扫描多次 exchangeCnt 0; for(i=O;i<DataArray.length-pass-l;i+){-次扫描过程 if(DataArraryl>DataArrary[i+l]){u∥-次两两交换过程 temp DataArray[i]; DataArray[i]DataArrary[i+1] DataArrary[i+1]temp; exchangeCnt++; } for (i=0;i<DataArray.length;i++) SortPro[pass+1][i)=DataArray[i;/记录本轮扫描后数据 if (exchangeCnt ==0) return; /排列情况 }} Programming in Java
8-11 Programming in Java • 排序程序:P151-152 void SortProcedure() { int pass,i,temp,exchangeCnt; for (pass = 0; pass<DataArray.length; pass++) {//扫描多次 exchangeCnt = 0; for (i =0; i< DataArray.length-pass-1; i++ ) {//一次扫描过程 if (DataArrary[i] > DataArrary[i+1] ) {//一次两两交换过程 temp = DataArray[i]; DataArray[i] = DataArrary[i+1] ; DataArrary[i+1] = temp; exchangeCnt++; } } for (i =0; i< DataArray.length; i++ ) SortPro[pass+1][i] = DataArray[i];//记录本轮扫描后数据 if (exchangeCnt ==0) return; //排列情况 } } 冒泡排序(3)
冒池排序(4) 8-1 int DataArray=new int[lO;/待排序数据的数组 int[][SortPro=new int11][10];∥保存排序过程的二维数组 if (e.getSource()sortbn) { for(i=O;i<DataArray.length;i++)/记录未排序的原始数据 SortPro[0][i]=DataArray[i]; SortProcedure(;/调用排序方法 RepaintO; 3 Programming in Java JAVA
8-12 Programming in Java … int[] DataArray = new int[10]; //待排序数据的数组 int[] [] SortPro = new int[11][10]; //保存排序过程的二维数组 冒泡排序(4) … if (e.getSource() = = sortbn) { for (i =0; i< DataArray.length; i++ ) //记录未排序的原始数据 SortPro[0][i] = DataArray[i]; SortProcedure(); //调用排序方法 Repaint(); } …