HOW2J.CN 先用选择法排序再用冒泡法排序的记录

package shuzu;

public class zuoye {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int [] a;
		a = new int[5];
		for (int i = 0; i < a.length; i++) {
			a[i] = (int)(Math.random()*100);
		}
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i]+" ");
		}
		System.out.println(" ");
		
		for (int j = 0; j < a.length-1; j++) {
			for (int i = j+1; i < a.length; i++) {
				if(a[j] > a[i]) {
					int temp = a[j];
					a[j] = a[i];
					a[i] = temp;
				}
				
			}
		}
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i]+" ");
		}
		System.out.println(" ");
		
		for (int j = 0; j < a.length; j++) {
			for (int i = 0; i <a.length-j-1; i++) {
				if(a[i]<a[i+1]) {
					int temp = a[i+1];
					a[i+1] = a [i];
					a[i]= temp;
				}
			}
			
		}
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i]+" ");
		}
		System.out.println(" ");
		
	}

}