2014.10.24 数组代码

1.将10个随机数按从小到大的顺序排列

<span style="font-size:14px;">public static void main(String[] args) {
		int[] f = new int[10];
		for (int i = 0; i <= f.length-1; i++) {
			f[i] = (int) (Math.random() * 100 + 1);
			System.out.print(f[i] + "\t");
		}
		System.out.println();

		int maxF = f[0];
		for (int i = 1; i < f.length; i++) {
			if (f[i] > maxF) {
				maxF = f[i];
			}
		}
		System.out.println("这些数的最大数为：" + maxF);

		int temp = 0;
		int minIndex = 0;

		 //简单选择排序法1
		for (int j = 0; j < f.length - 1; j++) {
		 minIndex = j;
		 for (int i = j + 1; i < f.length; i++) {
		 if (f[i] < f[minIndex]) {
		 minIndex = i;
		 }
		 }
		 if(minIndex!=f[i]){
	 temp = f[j];
		 f[j] = f[minIndex];
	 f[minIndex] = temp;
		 }
		}
		 for (int x : f) {
		 System.out.print(x + "  ");
		 }
		System.out.println();

		// 冒泡法
		boolean  swapped = true;
		for (int i = 1; i < f.length &&swapped; i++) {
			for (int j = 0; j < f.length - i; j++) {
				swapped=false;
				if (f[j] > f[j + 1]) {
					temp = f[j + 1];
					f[j + 1] = f[j];
					f[j] = temp;
					swapped = true;
				}
			}
		}
		for (int x : f) {
			System.out.print(x + "  ");
		}
		System.out.println();

		//简单排序法2
		for (int i = 0; i < f.length - 1; i++) {
			for (int j = i + 1; j < f.length; j++) {
				if (f[i] > f[j]) {
					temp = f[i];
					f[i] = f[j];
					f[j] = temp;
				}
			}
		}
		for (int x : f) {
			System.out.print(x + "  ");
		}

	}</span>