冒泡排序

import java.util.Scanner;

public class Demo01 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		int num[]=new int[5];
		for(int i=0;i<5;i++){
			System.out.print("请输入数据：");
			System.out.println();
			int an=s.nextInt();
			num[i]=an;
		}
		System.out.println("----排序前----");
		for(int i=0;i<5;i++){
			System.out.print(num[i]+" ");
		}
		for(int i=0;i<4;i++){
			for(int j=0;j<4-i;j++){
				if(num[j]>num[j+1]){
					int temp=0;
					temp=num[j+1];
					num[j+1]=num[j];
					num[j]=temp;
				}
			}
		}
		System.out.println();
		System.out.println("----排序后----");
		for(int i=0;i<5;i++){
			System.out.print(num[i]+" ");
		}
		s.close();
	}

}