冒泡排序算法

Java代码

package arithmetic;

//冒泡排序
public class BubbleSort {

   static int arry[] = new int[]{2,41,14,24,12,34,52,12,23,43,12,23,43};

    public static void main(String[] args) {
        sort(arry);
    }
    public static void sort(int[] arr) {
        System.out.println("冒泡排序前的结果：");
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " " );
        }
        //冒泡排序核心代码
        for (int i = 0; i < arr.length-1; i++) {
            for (int j = 0; j < arr.length-1-i; j++) {
                if (arr[j] > arr[j+1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] =  temp;
                }
            }
        }
        System.out.println();
        System.out.println("冒泡排序后的结果为: ");
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }

    }
}