DC分治法求数组最大最小值

#include<iostream>
void dcMaxMin( int [], int, int, int *, int * );
void dcMaxMin( int arr[], int low, int high, int *tmpMax, int *tmpMin )
{
if ( high - low <= 1)// 最多俩元素
{
if (arr[low] <= arr[high] )
{
*tmpMax = arr[high];
*tmpMin = arr[low];
return; // 递归出口
}
else
{
*tmpMax = arr[low];
*tmpMin = arr[high];
return; //递归出口
}
}
int min1, min2, max1, max2;
int mid = ( high - low ) / 2 + low;
//递归开始
dcMaxMin(arr, low, mid, &max1, &min1);
dcMaxMin(arr, mid+1, high, &max2, &min2);
*tmpMax = max1 < max2 ? max2 : max1;
*tmpMin = min1 < min2 ? min1 : min2;
}
int main()
{
int arr[] = {4, 1, 2, 9, 8, 3};
int len = sizeof ( arr ) / sizeof( int );
int max, min;
max = arr[0];
min = arr[0];
dcMaxMin(arr, 0, len, &max, &min);
std::cout << max << "t" << min << std::endl;
return 0;
}

最后

以上就是认真寒风最近收集整理的关于DC分治法求数组最大最小值的全部内容，更多相关DC分治法求数组最大最小值内容请搜索靠谱客的其他文章。