冒泡排序法

import java.util.Arrays;
public class maopao{
	public static void main(String[] args){
		int[]a={7,6,5,4,3,2,1};
		int[]b={1,2,3,4,5,6,8};
		//System.out.println("排序前：");
		//System.out.println(Arrays.toString(a));
		//System.out.println(Arrays.toString(b));

		printBubblesort(a);
		maopao(a);
		//System.out.println("排序后:");
		//System.out.println(Arrays.toString(a));
		//System.out.println(Arrays.toString(b));
		
		printBubblesort(b);
		maopao(b);
	}
    public static void printBubblesort(int[]a){
		System.out.println("排序前：");
		System.out.println(Arrays.toString(a));
		maopao(a);
		System.out.println("排序后:");
		System.out.println(Arrays.toString(a));
	}	
	public static int[] maopao(int[]nums){
		for(int i=0;i<nums.length;i++){
			for(int j=0;j<nums.length-i-1;j++){
				if(nums[j]>nums[j+1]){
					int t=nums[j];
					nums[j]=nums[j+1];
					nums[j+1]=t;
				}
			}
		}
		return nums;
    }
}