案例：java中的基本排序

 //冒泡排序

 import java.util.Arrays;

 public class ForTest{
     public static void main(String args[]){
         int[] arr = {34,54,12,45,23};
         System.out.println(Arrays.toString(arr));
         for(int i = 0; i <arr.length - 1; i++){
             for(int j = 0; j < arr.length - 1 -i; j++){
                 if(arr[j]>arr[j+1]){
                     int t = arr[j];
                     arr[j] = arr[j+1];
                     arr[j+1] = t;
                 }
             }
         }
         System.out.print(Arrays.toString(arr));
21      }
22　　}

//选择排序
import java.util.Arrays;

public class ForTest{
    public static void main(String args[]){
        int[] arr ={23,345,654,12};
        System.out.print(Arrays.toString(arr));
        for(int i = 0; i <arr.length - 1; i++){
            for(int j = i + 1; j <arr.length;j++){
                if(arr[i]>arr[j]){
                    int t = arr[i];
                    arr[i] = arr[j];
                    arr[j] = t;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}