java数组排序

public class Test2 {



	public static void main(String[] arg) {

		int[] nums={21,25,11,32,12,35,55,77,66,88};


		new Test2().doubleSort(nums,"asc");
		for (int i = 0; i<nums.length; i++){
			System.out.println (nums[i]);
		}

	}	


	//冒泡排序
	public void maopaoSort(int obj[],String sort) {


		int n = obj.length;
		if("asc".equalsIgnoreCase(sort)) {			
			for (int i = 0; i<n-1; i++){
				for (int j = 0; j<n-1; j++) {
					if(obj[j] > obj[j+1]) {
						int temp = obj[j];
						obj[j] = obj[j+1];
						obj[j+1] = temp;
					}
				}
			}
		} 
		if("desc".equalsIgnoreCase(sort)) {
			for (int i = 0; i<n-1; i++) {
				for (int j = 0; j<n-1; j++) {
					if(obj[j]<obj[j+1]) {
						int temp = obj[j+1];
						obj[j+1] = obj[j];
						obj[j] = temp;
					}
				}
			}
		}		
	}

	//双重for 排序
	public void doubleSort(int obj[],String sort) {

		int n = obj.length;

		if("asc".equalsIgnoreCase(sort)) {
			for (int i = 0; i<n; i++) {			
				for (int j = i; j<n; j++) {

					if(obj[i]>obj[j]) {

						int temp = obj[i];
						obj[i] = obj[j];
						obj[j] = temp;

					}					
				}
			}		
		}
		if("desc".equalsIgnoreCase(sort)) {

			for (int i = 0; i<n; i++) {
				for (int j = i; j<n; j++) {
					if(obj[i]<obj[j]) {
						int temp = obj[j];
						obj[j] = obj[i];
						obj[i] = temp;
					}
				}
			}
		}

	}

}

写了两个排序的方法。上面排序效率不是很好，有更好的算法请上传让小弟学习下。谢谢