写一个关于数组排序的Java程序（其二）

package nm;

import java.util.Arrays;

public class bn {

public int findMax(int[] arr){
	int len=arr.length;
	int i;
	int maxFlag = 0;
    int temp;
    int j = 0;
	
	
	   while(j<len){
        maxFlag = 0;
        i = 0;
        //查找最大值
        while (i<len - j) {
            if (arr[maxFlag] < arr[i]) {
                maxFlag = i;
            }
            i++;
       // System.out.println(Arrays.toString(arr));
     //   System.out.println(i);
        }
      // System.out.println("最大编号" + maxFlag);
       //交换 
       temp = arr[maxFlag];
        arr[maxFlag] = arr[len - j-1];
        arr[len - j-1] = temp;
        j++;
      //  System.out.println(Arrays.toString(arr));
}
	   return maxFlag;
	}

public static void main(String[] args) {
	// TODO Auto-generated method stub
  int[] a={1,2,3,4,0,4,8,3,10,9};
  int len=a.length;
  int maxFlag=0;
  System.out.println("原始数组"+Arrays.toString(a));
 bn bn=new bn();
  maxFlag=bn.findMax(a);
  System.out.println("排序后:"+Arrays.toString(a));
  
}

}