JAVA数组选择和冒泡排序

来源：互联网发布：mac浏览器打开网页慢编辑：程序博客网时间：2024/05/22 01:53

package test;

public class NumSort {

   public static void main(String[] args) {

       int[] arr = { 4, 8, 5, 9, 6, 2, 3, 1, 0 };
       for (int i = 0; i < arr.length; i++) {
           System.out.print(arr[i] + "\t");
       }

       System.out.println();
       System.out.println("***********************");

       // 选择排序法,从大到小
       for (int i = 0; i < arr.length; i++) {
           for (int j = i + 1; j < arr.length; j++) {
               if (arr[i] < arr[j]) {
                   int temp = arr[i];
                   arr[i] = arr[j];
                   arr[j] = temp;
               }
           }
           System.out.print(arr[i] + "\t");
       }

       System.out.println();
       System.out.println("***********************");

       // 选择排序法,从小到大
       for (int i = 0; i < arr.length; i++) {
           for (int j = i + 1; j < arr.length; j++) {
               if (arr[i] > arr[j]) {
                   int temp = arr[i];
                   arr[i] = arr[j];
                   arr[j] = temp;
               }
           }
           System.out.print(arr[i] + "\t");
       }

       System.out.println();
       System.out.println("***********************");

       // 冒泡排序法从小到大
       for (int i = 0; i < arr.length; i++) {
           for (int j = arr.length - 1; j > i; j--) {
               if (arr[j] < arr[j - 1]) {
                   int temp = arr[j];
                   arr[j] = arr[j - 1];
                   arr[j - 1] = temp;
               }
           }
           System.out.print(arr[i] + "\t");
       }

       System.out.println();
       System.out.println("***********************");

       // 冒泡排序法从小到大
       for (int i = 0; i < arr.length; i++) {
           for (int j = arr.length - 1; j > i; j--) {
               if (arr[j] > arr[j - 1]) {
                   int temp = arr[j];
                   arr[j] = arr[j - 1];
                   arr[j - 1] = temp;
               }
           }
           System.out.print(arr[i] + "\t");
       }
   }
}