排序函数

public static void insertionSort(int arr [])
{
    for (int i=0; i<arr.length-1 ;i++ )
    {
        for ( int j=i+1;j>0 ;j-- )
        {
            if (arr [j-1]<=arr [j])
                break;
            int temp= arr [j-1];
            arr [j-1] = arr [j];
            arr [j] = temp;
        }
    }
}

public static void bubbleSort(int arr[])
{
    for (int a = 0;a < arr.length;a++ )
    {
        for (int b = 0;b < arr.length-1;b++ )
        {
            if (arr[b]>arr[b+1])
            {
                int x = arr[b+1];
                arr [b+1]=arr [b];
                arr [b] = x;
            }
        }        
    }
}

public static void selectionSort(int recive[])
{
    int x ;
    for (int i = 0;i < recive.length-1;i++ )
    {
        for(int j=i+1; j<recive.length;j++)
        {
            if (recive [i]> recive [j])
            {
                x = recive [i];                   //数值互换
                recive [i]  = recive [j];
                recive [j] = x;
            }
        }
    }
}