java 改善型冒泡排序算法

public class example_sort {

 /**
  * @param args
  */
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  int arr[] = { 83 , 62, 10 , 100, 38 , 65 , 97 , 76 , 13 , 27 , 49 };
  int times = 0;
  for (int i = 0; i < arr.length; i++)
  {
   boolean completed = true;
   int temp;
   for (int j = 0; j < arr.length - 1 - i; j++)
   {
    if (arr[j] > arr[j+1]) {
     temp = arr[j];
     arr[j] = arr[j+1];
     arr[j+1] = temp;
     completed = false;
    }
   }
   if (completed) {times = i; break;}
  }
  //输出排序后的数组
        System.out.println("The array ' value sorted:");
        for (int i = 0; i < arr.length; i++ )
         System.out.println("arr["+i+"] = "+arr[i]);
        //输出总的排序次数
        System.out.println("Sort times = "+times);
 }

}