자바 기본 정렬 알고리즘 요약 (1) - 거품 정렬 법

                            ,                      33, 21, 54, 55, 666, 345, 543, 2, 678  ，        2 21 33 54 55 345 543 666 678 

/* * * @author:Richardwei * @description:      */
public class Test {
    public static void main(String[] args) {
        int a[] = { 33, 21, 54, 55, 666, 345, 543, 2, 678 };

        int i, j ;

        for (i = 0; i < a.length; i++) {

            for (j = 0; j < a.length - i; j++) {
                //     
                try {

                    if (a[j] > a[j + 1]) {
                        swap(a, j, j + 1);
                    }
                } catch (Exception e) {

                    // TODO: handle exception
                }
            }
        }
        for (i = 0; i < a.length; i++) {
            System.out.print(a[i] + " ");
        }
    }

    //            
    public static void swap(int a[] , int i , int j){
        int temp = a[i];
        a[i] = a[j];
        a[j] = temp;
    }

}