递归与分治（最大子数组问题&快速排序）

1、编程实现用分治法求解最大子数组问题。

public class kuaisu {
public static int partition(int[]a, int sp, int ep){
int x= a[ep];
int i = sp - 1;
for (int j = sp; j < ep;j++){
	if (a[j] <= x){
		int t=a[j];
		a[j]=a[i+1];
		a[i+1]=t;
		i++;
	}
}
int t=a[i+1];
a[i+1]=a[ep];
a[ep]=t;
int q=i+1;
return q;
}

public static void quickSort(int[]a, int sp, int ep){
if(sp<ep){
int q = partition(a, sp, ep);
quickSort(a, sp, q - 1);
quickSort(a, q+ 1, ep);
}
}

测试代码

public static void main(String[] args){
int[]a= {50,72,71,23,94,16,5,68};
quickSort(a, 0,a.length - 1);
for (int num : a){
System.out.print(num + " ");
}
}

2、编程实现用分治法求解快速排序问题。

public static int crossingsubarray(int[] x, int low, int mid, int right) {
		 int sum = 0;
		 int left = x[mid];
		 for (int i = mid; i >= low; i--) {
		 sum += x[i];
		 left=Math.max(left,sum);
		 }
		 sum=0;
		 int right1=x[mid+1];
		 for (int r = (mid + 1); r <= right1; r++) {
		 sum += x[r];
		 right1=Math.max(right1,sum);
		 }
		 int s3=left+right1;
		 return s3;
		 }
	
			public static int maxsubarray(int[]x, int low, int high) {
				 if (low == high) {
				 return x[low];
				 }
				 else {
					 int mid = (low + high) / 2;
					 int s1= maxsubarray(x, low, mid);
					 int s2= maxsubarray(x, mid + 1, high);
					 int s3= crossingsubarray(x, low, mid, high);
					 if(s1>s2&&s1>s3) {
						 return s1;
					 }
					 else if(s2>s1&&s2>s3) {
						 return s2;
					 }
					 else {
						 return s3;
					 }
				 }
			}

测试代码

public static void main(String[] args) {
	 int[] array = {-2,2,5,-7,-1,2,-4,3};
	 System.out.println(maxsubarray(array, 0, array.length-1));
	}