单个数组降序,升序排列.

package cn.itcast.demo;

/**

• @Description

• @auther lenovo

• @create 2019-09-19 21:44
  */
  public class Test9 {

  public static void main(String args[]) {
  int[] nums = {21, 23, 65, 34, 97};
  for (int i = 0; i < nums.length - 1; i++) {
  for (int j = 0; j < nums.length - i - 1; j++) {
  if (nums[j] < nums[j + 1]) {
  int temp = nums[j];
  nums[j] = nums[j + 1];
  nums[j + 1] = temp;
  }
  }
  }
  for (int i = 0; i < nums.length; i++) {
  System.out.print(nums[i] + “,”);
  }
  }
  }

======
输出结果
97,65,34,23,21,
Process finished with exit code 0

说明,理解冒泡思想,
当前变量,下一个变量,临时变量,不管比大还是比小,都是这个思路.