冒泡排序

public class maopao {
	public static int[] getMaoPao(int[] a){
		int[] s = new int[a.length];
		s=a;
		for(int i = 0; i<a.length; i++){
			for(int j = 0; j<a.length-1; j++){
				if(s[j]>s[j+1]){
					int k;
					k=s[j];
					s[j]=s[j+1];
					s[j+1]=k;
				}
			}
		}
		return s;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int a[]={1,5,6,3,9,8,7,8,2,5,4,7,1,2};
		int s[] = getMaoPao(a);
		for(int i=0;i<s.length;i++){
			System.out.println(s[i]);
		}

	}

}