Java对数组数值降序、升序：冒泡排序

冒泡排序

package coad;

import java.util.Arrays;

public class down {
	public static void main(String[] args) {
//		对该数组内的数字进行升序降序操作
		int[] numb = {78,45,656,97,451,10};
		
		//数组升序
		for (int i = 0; i < numb.length-1; i++) {
			for (int j = 0; j < numb.length-1-i; j++) {
				//交换位置
				if (numb[j] > numb[j+1]) {
					int temp = numb[j];
					numb[j] = numb[j+1];
					numb[j+1] = temp;
				}
			}
		}
//		[10, 45, 78, 97, 451, 656]
		System.out.println(Arrays.toString(numb));
		
		//数组降序
		for (int i = 0; i < numb.length-1; i++) {
			for (int j = 0; j < numb.length-1-i; j++) {
				//交换位置
				if (numb[j] < numb[j+1]) {
					int temp = numb[j];
					numb[j] = numb[j+1];
					numb[j+1] = temp;
				}
			}
		}
//		[656, 451, 97, 78, 45, 10]
		System.out.println(Arrays.toString(numb));
		
	}
	

}