Java基础 冒泡排序法

冒泡排序法

升序

package cn.xxxxx.algorithm;
import java.util.Arrays;
public class MaoPao {
//升序排序
	public static void main(String[] args) {

		int[] ar = { 1, 4, -6, 0, 1, 9, -1 };
		// 外循环循环一次,内循环循环一轮
		for (int i = 0; i < ar.length-1; i++) {
			for (int j = 0; j < ar.length-1; j++) {
				if (ar[j] > ar[j+1]) {
					int s = ar[j];
					ar[j] = ar[j+1];
					ar[j+1] = s;
				}
			}
		}
		System.out.println(Arrays.toString(ar));
	}
}

降序

package cn.xxxxx.algorithm;
import java.util.Arrays;
public class MaoPao {
//降序排序
	/**
	 * @author DYSlzx
	 */
	public static void main(String[] args) {

		int[] ar = { 1, 4, -6, 0, 1, 9, -1 };
		// 外循环循环一次,内循环循环一轮
		for (int i = 0; i < ar.length-1; i++) {
			for (int j = 0; j < ar.length-1; j++) {
			//只需要更改这个地方就行了
				if (ar[j] < ar[j+1]) {
					int s = ar[j];
					ar[j] = ar[j+1];
					ar[j+1] = s;
				}
			}
		}
		System.out.println(Arrays.toString(ar));
	}
}

运行效果