选择排序法,冒泡排序的优化

class xuanze  {   public static void main(String[] args)   {    int[] array = {5,3,6,2,87,8,124,79,0,4,5};    int z = 0;    for (int i = 0; i < array.length - 1; ++i)    {     z = i;     for (int j = i + 1; j < array.length; ++j)     {      if (array[j] < array[z])      {       z = j;      }     }     if (i != z)     {      array[i] += array[z];      array[z] = array[i] - array[z];      array[i] -= array[z];     }    }        for (int x : array)    {     System.out.printf("%4d",x);    }   }  }