Java 1024

package com.lovo;

public class Test01 {

	public static void main(String[] args) {
		int[] a = new int[10];
		
		for(int i = 0; i < a.length; i++) {
			a[i] = (int) (Math.random() * 99 + 1);
			System.out.print(a[i] + "\t");
		}
		System.out.println();
		
		int max, min;
		max = min = a[0];
		for(int i = 1; i < a.length; i++) {
			if(a[i] > max) {
				max = a[i];
			}
			else if(a[i] < min) {
				min = a[i];
			}
		}
		System.out.println("最大值: " + max);
		System.out.println("最小值: " + min);
	}
	
}

package com.lovo;

public class Test02 {

	public static void main(String[] args) {
		int[] a = new int[5];
		System.out.print("排序前: ");
		for(int i = 0; i < a.length; i++) {
			a[i] = (int) (Math.random() * 99 + 1);
			System.out.print(a[i] + "  ");
		}
		// 简单选择排序
		for(int i = 0; i < a.length - 1; i++) {
			int minIndex = i;
			for(int j = i + 1; j < a.length; j++) {
				if(a[j] < a[minIndex]) {
					minIndex = j;
				}
			}
			if(minIndex != i) {
				int temp = a[i];
				a[i] = a[minIndex];
				a[minIndex] = temp;
			}
		}
		
		System.out.print("\n排序后: ");
		for(int x : a) {
			System.out.print(x + "  ");
		}
	}
}

package com.lovo;

public class Test03 {

	public static void main(String[] args) {
		int[] a = new int[5];
		System.out.print("排序前: ");
		for(int i = 0; i < a.length; i++) {
			a[i] = (int) (Math.random() * 99 + 1);
			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]) {
					int temp = a[j];
					a[j] = a[j + 1];
					a[j + 1] = temp;
					swapped = true;
				}
			}
		}
		
		System.out.print("\n排序后: ");
		for(int x : a) {
			System.out.print(x + "  ");
		}
	}
}