冒泡排序法-Java实现

版权声明：转载请联系作者微信 2992860292, QQ同号, 未经许可, 禁止转载 https://blog.csdn.net/qq_40723748/article/details/84927307

public static void bubbleSort(int[] a) {
		int temp;
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a.length - 1; j++) {
				if (a[j] > a[j + 1]) {
					temp = a[j];
					a[j] = a[j + 1];
					a[j + 1] = temp;
				}
			}
		}
		for (int i = 0; i < a.length; i++)
			System.out.print(a[i] + " ");
	}