冒泡排序模板

阅读 12

2022-04-19

package sortPractice;

public class BubbleSort {
    public BubbleSort(int[] nums) {
        int i, j, k;
        for (i = 0; i < nums.length; i++) {
            for (j = nums.length - 1; j > i; j--) {
                if (nums[j] < nums[j - 1]) {
                    k = nums[j];
                    nums[j] = nums[j - 1];
                    nums[j - 1] = k;
                }
            }
        }
    }

    public static void main(String[] args) {
        int[] nums = new int[]{0,12, 239, 91, -2, 9282, 112, 32, 134};
        BubbleSort bubbleSort = new BubbleSort(nums);
        for (int num : nums) {
            System.out.println(num);
        }
    }
}

精彩评论(0)

0 0 举报