排序

package Test;

import java.util.Arrays;

public class ArraySort {
    public static void main(String[] args)
    {
        int[] arr= new int[]{23,19,5,8,45,3};
        System.out.println(Arrays.toString(arr));
        bubbleSort(arr);
        System.out.println(Arrays.toString(arr));
    }
    //第一种选择排序
    public static void  selectSort(int[] arr)
    {
        for (int i=0;i<arr.length-1;i++) {
            for(int j=i+1;j<=arr.length-1;j++)
            {
                int storage=0;
                if ( arr[i]>arr[j])
                {
                    storage=arr[i];
                    arr[i]=arr[j];
                    arr[j]=storage;
                }
            }
        }
    }
    //冒泡排序
    public static void bubbleSort(int[] arr)
    {
        for (int i=arr.length-1;i>=0;i--) {
            for(int j=0;j<=i-1;j++)
            {
                int storage=0;
                if ( arr[j]>arr[j+1])
                {
                    storage=arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=storage;
                }
            }
        }
    }
}

转载于:https://my.oschina.net/u/3554046/blog/2252689