讯飞实训之数组

对数组求平均值，求和，求极值,冒泡排序法

package com.cw.arrays;

public class Main {
	public static void main(String[] args) {
		int[] arrs = new int[] { 78, 56, 1, 99, 25, 15 };
		float max = getAvg(arrs);
		System.out.println(max);
	}

	/**
	 * 
	 * 获取和
	 * 
	 * @param arrs
	 * @return
	 */
	private static int getSum(int[] arrs) {
		int sum = 0;
		for (int i = 0; i < arrs.length; i++) {

			sum += arrs[i];
		}

		return sum;
	}

	/**
	 * 
	 * 获取数组的平均值
	 * 
	 * @param arrs
	 * @return
	 */
	private static float getAvg(int[] arrs) {

		int sum = 0;
		for (int i = 0; i < arrs.length; i++) {
			sum += arrs[i];
		}

		return sum / (float) arrs.length;
	}

	/**
	 * 
	 * 获取数则的最小值
	 * 
	 * @param arrs
	 * @return
	 */
	private static int getMin(int[] arrs) {
		int min = arrs[0];
		for (int i = 0; i < arrs.length; i++) {

			if (min > arrs[i]) {
				min = arrs[i];
			}
		}

		return min;
	}

	/**
	 * 
	 * 获取数组的最大值
	 * 
	 * @param arrs
	 * @return
	 */
	private static int getMax(int[] arrs) {
		int max = arrs[0];
		for (int i = 0; i < arrs.length; i++) {

			if (max < arrs[i]) {
				max = arrs[i];
			}
		}

		return max;
	}

	/**
	 * 
	 * 
	 * 冒泡排序法
	 */
	private static void paixu() {
		int[] nums = new int[] { 2, 1, 5, 3, 4, 8, 7, 9 };
		int i, j;
		for (i = 0; i < nums.length; i++) {
			for (j = 0; j < nums.length - i - 1; j++) {
				if (nums[j] > nums[j + 1]) {
					int x = nums[j];
					nums[j] = nums[j + 1];
					nums[j + 1] = x;
				}
			}
		}
		for (int x : nums) {
			System.out.println(x);
		}
	}
}