冒泡排序改进算法

public class SortTest2
{
    public static void main(String[] args)
    {
        int[] a = new int[args.length];
        for(int i=0; i<args.length; i++)
        {
            a[i] = Integer.parseInt(args[i]);
        }

        print(a);
        selectSort(a);
        print(a);

    }

    private static void selectionSort(int[] a)
    {
        int tmp;
        for(int i=0; i<a.length; i++)
        {
            for(int j=i+1; j<array.length; j++)
            {
                if(array[j]<array[j])
                {
                    tmp = array[j];
                    array[j] = array[i];
                    array[i] = tmp;
                }
            }
        }
    }

    private static void print(int[] a)
    {
        for(int i=0; i<a.length; i++)
        {
            System.out.print(a[i] + " ");
        }
        System.out.println();
    }
}

private static void selectionSort(int[] a)
    {
        int n,tmp;
        for(int i=0; i<a.length; i++)
        {
            n = i;

            for(int j = n+1; j<a.length; j++)
            {
                if(a[j] < a[n])
                {
                    n = j;
                }
            }

            if(n != i)
            {
                tmp = a[n];
                a[n] = a[i];
                a[i] = tmp;
            }
        }
    }