冒泡排序实现升序和降序排列

xiaoxiao2021-02-28  89

1.升序排列

public static void main(String[] args) { int[] arr = {9,21,34,1,17}; for(int i = 0; i< arr.length - 1; i++) { for(int j = 0;j< arr.length - i -1;j++) { if(arr[j] > arr[j+1]) { int temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } for (int i : arr) { System.out.print(i + " "); } }

2.降序排列(就是把if当中的判断改为”<”)

public static void main(String[] args) { int[] arr = {9,21,34,1,17}; for(int i = 0; i< arr.length - 1; i++) { for(int j = 0;j< arr.length - i -1;j++) { if(arr[j] < arr[j+1]) { int temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } for (int i : arr) { System.out.print(i + " "); } }
转载请注明原文地址: https://www.6miu.com/read-30749.html

最新回复(0)