递归与分治
递归实现合并排序:其中,算法merge合并2个排好序的数组到新的数组b中,然后由算法copy将合并后的
数组段再复制回数组a中。算法merge和copy显然可以在O(n)时间内万彩城,因此
合并排序算法对n个元素进行排序,在最坏情况下所需的计算时间T(n)=2T(n/2)+O(n)(n>1)
解此递归方程可知T(n)=)(nlogn)。
#include<stdio.h>
#include<assert.h>
#define length 7
void copy(int* ar_c, int* ar_d, int left, int right)
{
for (int i = left; i <= right; i++)
{
ar_c[i] = ar_d[i];
}
}
void merge(int *ar_c, int ar_d[length], int left, int middle, int right)
{
int left_left = left, left_right = middle;
int right_left = middle + 1, right_right = right;
int k = left;
while ((left_left <= left_right) && (right_left <= right_right))
{
if (ar_c[left_left] <= ar_c[right_left])
{
ar_d[k] = ar_c[left_left];
k++;
left_left++;
}
else
{
ar_d[k] = ar_c[right_left];
k++;
right_left++;
}
}
if (left_left > left_right)
{
for (int q = right_left; q <= right_right; q++, k++)
{
ar_d[k] = ar_c[q];
}
}
else
{
for (int q = left_left; q <= left_right; q++, k++)
{
ar_d[k] = ar_c[q];
}
}
}
void mergeSort(int *ar_a,int left,int right)
{
int ar_d[length] = {};
if (left<right)
{
int i = (left + right) / 2;
mergeSort(ar_a, left, i);
mergeSort(ar_a, i+1, right);
merge(ar_a,ar_d,left,i,right);
copy(ar_a,ar_d,left,right);
}
}
void Print(int *ar_a)
{
for (int i = 0; i < length; i++)
{
printf("%d ", ar_a[i]);
}
return;
}
int main()
{
int ar_a[length] = { 32,12,56,78,76,45,36 };
int left = 0, right = length - 1, middle = (left + right) / 2;
printf("before sorting:\n\t");
Print(ar_a);
mergeSort(ar_a, 0, right);
printf("\nafter sorting:\n\t");
Print(ar_a);
return 0;
}