Test2:数组常见算法

/*  笔记： day4_7（数组常见算法）
 *  
 */

public class Test2 {
	public static void main(String[] args) {
		
		//求数组元素的最大值、最小值、总和、平均数
		int[] arr = new int[] {1,2,38,96,4};
		
		//最大值
		int max = arr[0];
		for (int i = 0; i < arr.length; i++) {
			if (max < arr[i])
				max = arr[i];
		}
		System.out.println("max:" + max);
		
		//最小值
		int min = arr[0];
		for (int i = 0; i < arr.length; i++) {
			if (min > arr[i])
				min = arr[i];
		}
		System.out.println("min:" + min);
		
		//总和、平均数
		int sum = 0;
		for (int i = 0; i < arr.length; i++) {
			sum += arr[i];
		}
		System.out.println("sum:" + sum);
		System.out.println("mean:" + (sum / arr.length));
		
		//数组的复制和反转
		
		//复制
		int[] copy =new int[arr.length];
		for (int i = 0; i < arr.length; i++)
			copy[i] = arr[i];
		
		//反转
		int[] temp = new int[arr.length];
		int k = 0;  //temp元素的下标
		for (int i = arr.length - 1; i >= 0; i--) {
			temp[k] = arr[i];
			k++;
		}
		arr = temp;  //直接数组和数组对应赋值了
		
		//数组的排序
		
		//冒泡排序
		for (int i = 0; i < arr.length; i++) {
			for (int j = 0; j < arr.length - i; j++) {
				if (arr[j] > arr[j + 1]) {
					int k1 = 0;
					k1 = arr[j + 1];
					arr[j + 1] = arr[j];
					arr[j] = k1;
				}
			}
		}
	}
}