冒泡法排序改进版

public class ChangeTurnTest{   public static void changeTurn(int[]b)     {      for(int j=0;j<b.length-1;j++)       {         int k=0;         for(int i=0;i<b.length-1-j;i++)         {            if(b[i]>b[i+1])               {                  int temp=b[i];                  b[i]=b[i+1];                  b[i+1]=temp;                  k=1;               }         }          if(k==0)           return;          }     }   public static void main(String args[])    {      int []a={1,3,7,2,6,9,0,8,5,4};      changeTurn(a);      for(int i=0;i<a.length;i++)        System.out.println(a[i]);      }}