java实现冒泡和选择排序

 

http://www.admin10000.com/document/211.html

http://www.admin10000.com/document/794.html

这两篇关于排序的文章都写的很不错，大家感兴趣可以看看，不过在下资质愚鲁目前只搞明白了选择和冒泡排序的思想，别的啥时候弄明白了后续在补吧。

package com.temp;

public class SortTest {
	public static void main(String[] args) {
		int[] array={32,12,33,5,95,20,45,123};
		int[] array1={32,12,33,5,95,20,45,123};
		new SortTest().xuanze(array);
		new SortTest().maopao(array1);
		//选择排序
	}
	public void xuanze(int[] array){
		System.out.println("\n选择排序：");
		for(int i=0;i<array.length;i++){
			for(int j=i+1;j<array.length;j++){
				if(array[i]>array[j]){
					int temp=array[i];
					array[i]=array[j];
					array[j]=temp;
				}
			}
			System.out.println("");
			for(int t=0;t<array.length;t++){
				System.out.print(array[t]+",");
			}
		}
		
		System.out.println("\n最终排序结果:");
		for(int k=0;k<array.length;k++){
			System.out.print(array[k]+",");
		}
	}
	
	public void maopao(int[] array){
		System.out.println("\n冒泡排序：");
		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array.length-1; j++) {
				if(array[j]>array[j+1]){
					int temp=array[j];
					array[j]=array[j+1];
					array[j+1]=temp;
				}
			}
			System.out.println("");
			for(int k:array){
				System.out.print(k+",");
			}
		}
		System.out.println("\n最终排序结果");
		for(int k:array){
			System.out.print(k+",");
		}
	}
}