冒泡排序

来源：互联网发布：ubuntu 设置ntp客户端编辑：程序博客网时间：2024/05/17 23:52

//冒泡排序public class Sort { public static void main(String[] args){           int score[] = {67, 69, 75, 87, 89, 90, 99, 100};           for (int i = 0; i < score.length -1; i++){    //最多做n-1趟排序               for(int j = 0 ;j < score.length - i - 1; j++){    //对当前无序区间score[0......length-i-1]进行排序(j的范围很关键，这个范围是在逐步缩小的)                   if(score[j] < score[j + 1]){    //把小的值交换到后面                       int temp = score[j];                       score[j] = score[j + 1];                      score[j + 1] = temp;                  }              }                          System.out.print("第" + (i + 1) + "次排序结果：");              for(int a = 0; a < score.length; a++){                  System.out.print(score[a] + "\t");              }           }              System.out.print("最终排序结果：");              for(int a = 0; a < score.length; a++){                  System.out.print(score[a] + "\t");        }     }}

//冒泡排序public class Sort1 {static void bubble_sort(int[] unsorted) {for (int i = 0; i < unsorted.length; i++) {for (int j = i; j < unsorted.length; j++) {if (unsorted[i] > unsorted[j]) {int temp = unsorted[i];unsorted[i] = unsorted[j];unsorted[j] = temp;}}}}public static void main(String[] args) {int[] x = { 6, 2, 4, 1, 5, 9 };bubble_sort(x);for (int i : x) {System.out.print(i);}}}

重点区分基本数据类型和引用数据类型

阅读全文

0 0