数据结构与算法_2_1_冒泡排序

冒泡排序（升序）

/**
 * @author jiang--
 * @date2021/5/1417:09
 */
public class a3冒泡排序 {
    private static Integer[] arr= {11,23,34,4,56,6,7};

    public static void main(String[] args) {
        bubbleSort(arr);
        List<Integer> ints = Arrays.asList(arr);
        myOverride(ints);
    }

    public static Integer[] bubbleSort(Integer[] arr) {
        for(int i=0; i<arr.length;i++) {
            for(int j=arr.length-1; j>i; j--) {
                if(arr[j]<arr[j-1]) {
                    swap(arr, j-1, j);
                }
            }
        }
        return arr;
    }

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

    public static void myOverride(List list){
        String result = "";
        for (int i = 0; i < list.size(); i++) {
            String s = list.get(i).toString() + " ";
            result += s;
        }
        System.out.println(result);
    }

}