java数据结构与java算法

1、冒泡排序

1.1、冒泡排序算法思路图解

1.2、冒泡排序算法代码实现

public class BubbleSort {
    public static void main(String[] args) {
        int arr[] = {3,9,-1,10,-2};
        int temp = 0;
        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]) {
                    temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
            System.out.println("第" + (i+1) + "次排序");
            System.out.println(Arrays.toString(arr));
        }
    }
}

1.3、冒泡排序算法优化和总结

public static void main(String[] args) {
        int arr[] = {3,9,-1,10,-2};
        int temp = 0;//临时变量
        boolean flag = false;
        for (int i = 0; i < arr.length-1; i++) {
            for (int j = 0; j < arr.length-1-i; j++) {
                flag = true;
                if (arr[j] > arr[j+1]) {
                    temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
            System.out.println("第" + (i+1) + "次排序");
            System.out.println(Arrays.toString(arr));
            if (!flag) {//在一趟排序中，一次交换都没有发生
                break;
            } else{
                flag = false;//重置flag，进行下次判断
            }
        }
    }