减而治之和分而治之在数组中的应用

#include<iostream>
#include<algorithm>
#include<assert.h>
using namespace std;

/*
减而治之（decrease-and-conquer）
*/

static void show(int data[], int length)
{
	assert(NULL != data && length > 0);

	for (int i = 0; i<length; i++)
	{
		cout << data[i] << " ";
	}
	cout << endl;
}

void reverse(int data[], int length, int low, int high)  //每次规模缩小2 
{
	assert(NULL != data && low >= 0 && high < length);

	if (low < high)
	{
		swap(data[low], data[high]);
		reverse(data, length, low + 1, high - 1);
	}
}

void reverse1(int data[], int length, int low, int high)  //每次规模缩小2 
{
	assert(NULL != data && low >= 0 && high < length);

	while (low < high)
	{
		swap(data[low++], data[high--]);
	}
}


/*
分而治之（divide-and-conquer）
数组求和：二分递归
*/
int sum(int data[], int length, int low, int high)
{
	assert(NULL != data && low >= 0 && high < length);

	if (low == high)
	{
		return data[low];
	}
	int mid = ((high - low) >> 1) + low;

	return sum(data, length, low, mid) + sum(data, length, mid + 1, high);
}

void findMax2(int data[], int length, int low, int high, int &x1, int &x2)
{
	assert(NULL != data && low >= 0 && high < length);

	int i = low + 1;   //注意此处不能合并在for循环内部，否则会出现for(int i=low+1, x1=low; ...)这样相当于重新定义了一个变量x1
	for (x1 = low; i<length; i++)
	{
		if (data[x1] < data[i])
		{
			x1 = i;
		}
	}
	int j = low + 1;
	for (x2 = low; j<x1; j++)
	{
		if (data[x2] < data[j])
		{
			x2 = j;
		}
	}
	for (int k = x1 + 1; k<high; k++)
	{
		if (data[x2] < data[k])
		{
			x2 = k;
		}
	}

}

void optimizeFindMax2(int data[], int length, int low, int high, int &x1, int &x2)  //初步优化
{
	assert(NULL != data && low >= 0 && high < length);
	
	if (data[x1 = low] < data[x2 = low + 1])   //初始化
	{
		swap(x1, x2);
	}

	for (int i = 0; i < length; i++)
	{
		if (data[x2] < data[i])
		{
			if (data[x1] < data[x2 = i])  //代码简洁
			{
				swap(x1, x2);
			}
		}
	}
}


int midMax(int data[], int lo, int hi)     //三个数返回中间数的下标
{
	int re = 0;
	if (data[lo] > data[lo+1])
	{
		if (data[lo+1] > data[hi])
		{
			re = lo+1;
		}
		else
		{
			if (data[lo] > data[hi])
			{
				re = hi;
			}
			else
			{
				re = lo;
			}
		}
		return re;
	}
	else
	{
		if (data[lo+1] < data[hi])
		{
			re = lo+1;
		}
		else
		{
			if (data[lo]>data[hi])
			{
				re = lo;
			}
			else
			{
				re = hi;
			}
		}
		return re;
	}
}

void optimalfindMax2(int data[], int length, int low, int high, int &x1, int &x2)
{
	assert(NULL != data && low >= 0 && high < length);

	if (low + 1 == high)    //有两个元素
	{
		if (data[low]<data[high])
		{
			x1 = high;
			x2 = low;
			return;
		}
		else
		{
			x1 = low;
			x2 = high;
			return;
		}
	}

	if (low + 2 == high)    //有3个元素
	{
		int tmp1 = max(data[low], data[low + 1])>data[low + 1] ? low : low + 1;
		x1 = max(data[tmp1], data[high])>data[high] ? tmp1 : high;
		x2 = midMax(data, low, high);
		
		return;
	}

	int mid = ((high - low) >> 1) + low;
	
	int x1L, x2L, x1R, x2R;
	optimalfindMax2(data, length, low, mid, x1L, x2L);
	optimalfindMax2(data, length, mid+1, high, x1R, x2R);

	if (data[x1L] > data[x1R])
	{
		x1 = x1L;
		x2 = (data[x2L] > data[x1R]) ? x2L : x1R;
	}
	else
	{
		x1 = x1R;
		x2 = (data[x1L] > data[x2R]) ? x1L : x2R;
	}
}

int main()
{
	int arr[] = { 22, 8, 10, 1, 6, 5, 3, 29};
	int len = sizeof(arr) / sizeof(arr[0]);
	show(arr, len);

	int max1 = -1;
	int max2 = -1;
	//findMax2(arr, len, 0, len - 1, max1, max2);
	//optimizeFindMax2(arr, len, 0, len - 1, max1, max2);
	optimalfindMax2(arr, len, 0, len - 1, max1, max2);
	cout << max1 << " " << max2 << endl;

	//reverse(arr, len, 0, len-1);
	//reverse1(arr, len, 0, len-1);
	//show(arr, len);

	//int getsum = sum(arr, len, 0, len-1);
	//cout<<getsum<<endl;
	return 0;
}