Java实现冒泡排序算法

冒泡排序算法

import java.util.*;
public class BubbleSort{

    private static void sort(int[] dataArr){
        boolean change = true;
        for(int i = 0; i < dataArr.length && true; i++){
            int j = 1;
            change = false;
            while(j < dataArr.length - i){
                if(dataArr[j] < dataArr[j - 1]){
                    int temp = dataArr[j];
                    dataArr[j] = dataArr[j - 1];
                    dataArr[j - 1] = temp;
                    change = true;
                }
                j++;
            }
        }
    }

    public static void main(String[] args){
        int[] dataArr = new int[args.length];
        for(int i = 0; i < args.length; i++){
            try{
                dataArr[i] = Integer.valueOf(args[i]);
            }catch(NumberFormatException e){
                System.out.println("input invalid decimal integer:" + e.getMessage());
                return;
            }

        }
        System.out.println("befort sort:" + Arrays.toString(dataArr));
        sort(dataArr);
        System.out.println("after sort:" + Arrays.toString(dataArr));
    }
}

运行：
javac BubbleSort.java
java BubbleSort 49 38 65 97 76 13 27
输出：
befort sort:[49, 38, 65, 97, 76, 13, 27]
after   sort:[13, 27, 38, 49, 65, 76, 97]