int[] a = new int[10];		for (int i = 0; i < a.length; i++) {			a[i] = random();			System.out.print(a[i] + "   ");		}		System.out.println();		int temp = 0;		// 从小到大		// 简单选择排序法		// 方法1		int minIndex = 0;		for (int i = 0; i < a.length - 1; i++) {			minIndex = i;			for (int j = i + 1; j < a.length; j++) {				if (a[j] < a[minIndex]) {					minIndex = j;				}				if (minIndex != i) {					temp = a[i];					a[i] = a[minIndex];					a[minIndex] = temp;				}			}		}		System.out.println();		for (int x : a) {			System.out.print(x + "   ");		}		// 方法2		for (int i = 0; i < a.length - 1; i++) {			for (int j = i + 1; j < a.length; j++) {				if (a[i] > a[j]) {					temp = a[i];					a[i] = a[j];					a[j] = temp;				}			}		}				System.out.println("从小到大的值为：");		for (int i = 0; i < a.length; i++) {			System.out.print(a[i] + "   ");		}		// 冒泡算法		boolean swapped = true;		for (int i = 1; swapped && i <= a.length - 1; i++) {			swapped = false;			for (int j = 0; j < a.length - i; j++) {				if (a[j] > a[j + 1]) {					temp = a[j];					a[j] = a[j + 1];					a[j + 1] = temp;					swapped = true;				}			}		}		for (int x : a) {			System.out.print(x + "   ");		}	}