简单排序之冒泡排序

口诀:
两两相比
大数沉底
外层n-1
内层n-1-i

package sort;

/**
 * 冒泡排序
 */
public class Bubble {

    public static void main(String[] args) {

        int[] array = { 1, 3, 5, 2, 4 };

        System.out.println("未排序前:");
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] + " ");
        }

        bubbleSort(array);
        System.out.println();
        System.out.println("排序后:");
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] + " ");
        }
    }

    /*
    冒泡排序:两两相比、大数沉底、外层n-1、内层n-1-i
     */
    public static void bubbleSort(int[] array){

        for (int i = 0; i < array.length - 1; i++) {
            for (int j = 0; j < array.length - 1 - i; j++) {

                if(array[j] > array[j + 1]){
                    int temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
                }
            }
        }
    }
}

猜你喜欢

转载自blog.csdn.net/qq_33591873/article/details/107205196
今日推荐