关于Java中的选择排序法和冒泡排序法

public static void selectSort(int arr[]){
	    	for (int i = 0; i < arr.length-1; i++) {
				for (int j = i+1; j < arr.length; j++) {
					if(arr[j]<arr[i]){
						int temp=arr[i];
						arr[i]=arr[j];
						arr[j]=temp;
					}
				}
			}
	    }

public static void sel_sort(int[] x, int n){  
	        int k, i, m, t;  
	        for(k=0; k<n-1; k++){  // 多趟排序   
	            m = k;  
	            for(i=k+1; i<n; i++){  
	                if(x[i] < x[m])
	                	m = i;
	            }  
	            t = x[k];  
	            x[k] = x[m];  
	            x[m] = t;  
	        }  
	    }

private static void 冒泡排序(int[] arr) {
		for (int j = 0; j < arr.length-1; j++) {
			for(int i=0;i<arr.length-1-j;i++){
			if(arr[i]>arr[i+1]){
				int temp=arr[i];
				arr[i]=arr[i+1];
				arr[i+1]=temp;
				}
			}
		}		
	}