数组排序,选择排序法
1 package com.pang.array_demo; 2 3 import java.util.Arrays; 4 5 public class Array_Demo { 6 public static void main(String[] args) { 7 int[] arr = { 1, 5, 3, 23, 3, 45 }; 8 arraySort(arr); 9 arrayDesc(arr); 10 } 11 //正序 12 public static void arraySort(int[] arr) { 13 for (int i = 0; i < arr.length - 1; i++) { 14 for (int j = i+1 ; j < arr.length; j++) { 15 if (arr[i] > arr[j]) { 16 int t = arr[i]; 17 arr[i] = arr[j]; 18 arr[j] = t; 19 } 20 } 21 } 22 System.out.println(Arrays.toString(arr)); 23 } 24 //倒序 25 public static void arrayDesc(int[] arr){ 26 for (int i = 0; i < arr.length - 1; i++) { 27 for (int j = i+1 ; j < arr.length; j++) { 28 if (arr[i] < arr[j]) { 29 int t = arr[i]; 30 arr[i] = arr[j]; 31 arr[j] = t; 32 } 33 } 34 } 35 System.out.println(Arrays.toString(arr)); 36 } 37 }