귀속 방법을 이용하여 하나의 수조의 최대치를 구하다

1. 직접 이용 귀속:

package programmer;

import java.util.Scanner;

/*
 *  
 */
public class MaxRecursion {
	public int maxRecursion(int[] A, int low, int high) {
		if (low > high)
			return -1;
		else {
			if (A[low] < maxRecursion(A, low + 1, high))
				return maxRecursion(A, low + 1, high);
			else
				return A[low];
		}
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		for (int i = 0; i < A.length; i++)
			A[i] = sc.nextInt();
		System.out.println(new MaxRecursion().maxRecursion(A, 0, A.length - 1));
	}
}

2. 두 갈래로 배열의 최대 값을 찾습니다.

package programmer;

import java.util.Scanner;

/*
 *  
 */
public class MaxBinarySearch {
	public int maxBinarySearch(int[] A, int low, int high) {
		if (low > high)
			return -1;
		else {
			int mid = (low + high) / 2;
			int tmp = maxBinarySearch(A, low, mid - 1) > maxBinarySearch(A,
					mid + 1, high) ? maxBinarySearch(A, low, mid - 1)
					: maxBinarySearch(A, mid + 1, high);
			return tmp > A[mid] ? tmp : A[mid];
		}
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		for (int i = 0; i < A.length; i++)
			A[i] = sc.nextInt();
		System.out.println(new MaxBinarySearch().maxBinarySearch(A, 0,
				A.length - 1));
	}
}

그러나 복잡도는 줄어들지 않고 새로운 사고방식을 제공할 뿐이다.