常用算法案例之分治法（C语言）

1.归并排序

#include <stdlib.h>
#include <stdio.h>
 
void Merge(int sourceArr[],int tempArr[], int startIndex, int midIndex, int endIndex)
{
    int i = startIndex, j=midIndex+1, k = startIndex;
    // 找出较小值元素放入temp数组中
    while(i!=midIndex+1 && j!=endIndex+1)
    {
        if(sourceArr[i] > sourceArr[j])
            tempArr[k++] = sourceArr[j++];
        else
            tempArr[k++] = sourceArr[i++];
    }
    // 处理左边或右边较长部分
    while(i != midIndex+1)
        tempArr[k++] = sourceArr[i++];
    while(j != endIndex+1)
        tempArr[k++] = sourceArr[j++];
    //使用temp中的元素覆盖nums中元素
    for(i=startIndex; i<=endIndex; i++)
        sourceArr[i] = tempArr[i];
}
 
//内部使用递归
void MergeSort(int sourceArr[], int tempArr[], int startIndex, int endIndex)
{
    int midIndex;
    if(startIndex < endIndex)
    {
        midIndex = startIndex + (endIndex-startIndex) /2;//避免溢出int
        MergeSort(sourceArr, tempArr, startIndex, midIndex);  //处理左边
        MergeSort(sourceArr, tempArr, midIndex+1, endIndex);  //处理右边
        Merge(sourceArr, tempArr, startIndex, midIndex, endIndex); //左右归并
    }
}
 
int main(int argc, char * argv[])
{
    int a[8] = {50, 10, 20, 30, 70, 40, 80, 60};
    int i, b[8];
    MergeSort(a, b, 0, 7);
    for(i=0; i<8; i++)
        printf("%d ", a[i]);
    printf("\n");
    return 0;
}

2.最大子段和

// 分治法最大子段和.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <stdio.h>

/**
*  find a max integer in a,b,c
*
*/
static int max3(int a, int b, int c)
{
	return (a>b ? a : b)>c ? (a>b ? a : b) : c;

}

static int maxSubSum(const int A[], int left, int right)
{
	int maxLeftSum, maxRightSum;
	int maxLeftBorderSum, maxRightBorderSum;
	int leftBorderSum, rightBorderSum;
	int center, i;
	int sum = 0;
	if (left == right)
	{
		if (A[left] > 0) 
			sum = A[left];
		else 
			sum = 0;
		return sum;
	}

	center = (left + right) / 2;
	maxLeftSum = maxSubSum(A, left, center);
	maxRightSum = maxSubSum(A, center + 1, right);

	maxLeftBorderSum = 0;
	leftBorderSum = 0;
	for (i = center; i >= left; i--) {        //计算左侧所有值的和
		
		if (A[i] >= 0)  //添加条件
		leftBorderSum += A[i];
		if (leftBorderSum > maxLeftBorderSum)
			maxLeftBorderSum = leftBorderSum;
	}
	 printf("左-->个数 = %d maxLeftBorderSum = %d maxLeftSum =%d \n", center-left+1,maxLeftBorderSum, maxLeftSum);
	maxRightBorderSum = 0;
	rightBorderSum = 0;
	for (i = center + 1; i <= right; i++) {    //计算右侧所有值的和
		if (A[i] >= 0)  //添加条件
		rightBorderSum += A[i];
		if (rightBorderSum > maxRightBorderSum)
			maxRightBorderSum = rightBorderSum;
	}
	 printf("右-->个数 = %d maxRightBorderSum = %d maxRightSum =%d \n",right - center ,maxRightBorderSum, maxRightSum);
	sum = maxLeftBorderSum + maxRightBorderSum;
	 printf("-->sum = %d \n---------------------\n", sum);
	return  max3(maxLeftSum, maxRightSum, sum);

}

int main(int argc, const char * argv[]) {

	int arr[8] = { 1, -1, 2, 3, -7, 4, 8, 6 };

	printf("the max sub arr sum is : %d\r", maxSubSum(arr, 0, 7));
	while (1);
	return 0;
}