查找最大值的两种解法

查询最大值

最近看算法与数据结构，写一写当中的练习，方便以后查阅

public class FindMaxTest {
	public static void main(String[] args) {
		int[] arr = { 3, 5, 8, 6, 11, 56, 32 };
		long firstStart = System.currentTimeMillis();
		int max = FindMaxTest.findMax(arr);
		long firstEnd = System.currentTimeMillis();
		System.out.println("第一种算法------：" + max + "----------时间间隔：---------" + (firstEnd - firstStart));// 56
		int findMax2 = findMax2(arr, 3);
		long secondEnd = System.currentTimeMillis();
		System.out.println("第二种算法====" + findMax2 + "----------时间间隔：---------" + (firstStart - secondEnd));// 56
	}

	public static int findMax(int[] arr) {

		for (int i = 0; i < arr.length; i++) {
			for (int j = 0; j < arr.length - 1; j++) {
				int cur = arr[j];
				int next = arr[j + 1];

				if (cur > next) {
					int tmp = arr[j];

					arr[j] = arr[j + 1];
					arr[j + 1] = tmp;
				}
			}
		}
		// System.out.println(Arrays.toString(arr));
		return arr[arr.length - 1];
	}

	public static int findMax2(int[] arr, int k) {
		int[] preK = Arrays.copyOf(arr, k);
		int[] affK = Arrays.copyOfRange(arr, k, arr.length);

		int maxBeforeK = findMax(preK);
		for (int i = 0; i < affK.length; i++) {
			if (affK[i] > maxBeforeK) {
				maxBeforeK = affK[i];
			}
		}
		return maxBeforeK;
	}
    public static int findMax3(int[] arr) {
		int maxIndex = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[maxIndex] < arr[i]) {
				maxIndex = i;
			}
		}
		return arr[maxIndex];
	}
}