JAVA基础的三种排序方法

public class BubbleSort {

public static void main(String[] args) {
	int [] array=new int[] {1,22,15,33,46,14};
	BubbleSort bs = new BubbleSort();
	bs.sort(array);
}
//冒泡排序
public void sort(int []array) {
	for(int i=1;i<array.length-1;i++) {
		for(int j=0;j<array.length-i;j++) {
			int temp;
			if(array[j]>array[j+1]) {
				temp=array[j];
				array[j]=array[j+1];
				array[j+1]=temp;
			}
		}
	}
	showArray(array);
}
public void showArray(int []array) {
	for(int l :array) {
			System.out.print(l+" ");
	}
}

}

public class ReverseSort {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	int []array=new int[] {1,33,24,11,22,45};
	ReverseSort rs=new ReverseSort();
	rs.sort(array);
}
//反转排序
public void sort(int[]array) {
	for(int i=1;i<=array.length/2;i++) {
		int temp;
		temp=array[i-1];
		array[i-1]=array[array.length-i];
		array[array.length-i]=temp;
	}
	showArray(array);
}
public void showArray(int[]array) {
	for(int l:array) {
	System.out.print(l+" ");
	}
}

}

public class SelectSort {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	int [] array=new int[] {1,22,15,33,46,14};
	SelectSort ss=new SelectSort();
	ss.sort(array);
}
//直接选择排序法
public void sort(int[]array) {
	for(int i=1;i<array.length;i++) {
		int index=0;
		for(int j =1;j<=array.length-i;j++) {
			if(array[j]>array[index]) {
				index=j;
			}
		}
		int temp;
		temp=array[array.length-i];
		array[array.length-i]=array[index];
		array[index]=temp;
		
	}
	showArray(array);
}
public void showArray(int[]array) {
	for(int l:array) {
		System.out.print(l+" ");
	}
}

}