Java之排序（冒泡排序、选择排序）

（1）冒泡排序代码实现：

/*
*冒泡排序法文件名：BubbleSort.java
*/

public class BubbleSort{
	public static void main(String[] args){
		int [] a = {2,3,41,5,2,55,83,24};

		System.out.println("排序前的数组为：");
		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}
		System.out.println();

		for(int i = 0; i < a.length - 1; i++){
			for(int j = 0; j < a.length - 1 - i; j++){
				if(a[j] < a[j + 1]){
					int temp = a[j];
					a[j] = a[j + 1];
					a[j + 1] = temp;
				}
			}
		}

		System.out.println("冒泡排序后的结果为：");

		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}

		System.out.println();
	}
}

/*
*冒泡排序法：函数实现,文件名：Bubble.java
*/

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

	public static void main(String[] args){
		int [] a = {2,3,41,5,2,55,83,24};

		System.out.println("排序前的数组为：");
		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}
		System.out.println();

		Bubble.BubbleSort(a);

		System.out.println("冒泡排序后的结果为：");

		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}

		System.out.println();
	}
}

（2）选择排序代码实现：

/*
*选择排序法,文件名：SelectSort.java
*/

public class SelectSort{
	public static void main(String[] args){
		int [] a = {2,3,41,5,2,55,83,24};

		System.out.println("排序前的数组为：");
		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}
		System.out.println();

		for(int i = 0; i < a.length; i++){
			int k = i;
			for(int j = i + 1; j < a.length; j++){
				if(a[k] < a[j])
					k = j;
			}
			if(k != i){
				int temp = a[k];
				a[k] = a[i];
				a[i] = temp;
			}
		}

		System.out.println("选择排序后的结果为：");

		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}

		System.out.println();
	}
}

/*
*选择排序法，函数实现，文件名：Select.java
*/

public class Select{
	public static void SelectSort(int a[]){
		for(int i = 0; i < a.length; i++){
			int k = i;
			for(int j = i + 1; j < a.length; j++){
				if(a[k] < a[j])
					k = j;
			}
			if(k != i){
				int temp = a[k];
				a[k] = a[i];
				a[i] = temp;
			}
		}
	}
	public static void main(String[] args){
		int [] a = {2,3,41,5,2,55,83,24};

		System.out.println("排序前的数组为：");
		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}
		System.out.println();

		Select.SelectSort(a);

		System.out.println("选择排序后的结果为：");

		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}

		System.out.println();
	}
}