作业四

最新推荐文章于 2024-09-11 19:54:50 发布

xalatath

最新推荐文章于 2024-09-11 19:54:50 发布

阅读量80

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/xalatath/article/details/105044636

版权

1.问题
二分归并排序：对n个不同的数构成的数组A[1…n]进行排序，其中n=2^k
2.解析
在这里插入图片描述
3.设计

int mergearray(int a[], int left, int mid, int right, int temp[])  
{  
    int i = left;
	int j = mid + 1;  
    int m = mid;
	int n = right;  
    int k = 0;  
      
    while (i <= m && j <= n)  
    {  
        if (a[i] <= a[j])  
            temp[k++] = a[i++];  
        else  
            temp[k++] = a[j++];  
    }  
      
    while (i <= m)  
        temp[k++] = a[i++];  
      
    while (j <= n)  
        temp[k++] = a[j++];  
      
    for (i = 0; i < k; i++)  
        a[left + i] = temp[i];  
}  

int mergesort(int a[], int left, int right, int temp[])  
{  
    if (left < right)  
    {  
        int mid = (left + right) / 2;  
        mergesort(a, left, mid, temp);     
        mergesort(a, mid + 1, right, temp); 
        mergearray(a, left, mid, right, temp); 
    }  
}

4.分析
T（n）=O(nlog2n)
5.源码

#include<stdio.h>

int arr[8]={5,33,12,123,55,853,113,2333};
int mergearray(int a[], int left, int mid, int right, int temp[])  
{  
    int i = left;
	int j = mid + 1;  
    int m = mid;
	int n = right;  
    int k = 0;  
      
    while (i <= m && j <= n)  
    {  
        if (a[i] <= a[j])  
            temp[k++] = a[i++];  
        else  
            temp[k++] = a[j++];  
    }  
      
    while (i <= m)  
        temp[k++] = a[i++];  
      
    while (j <= n)  
        temp[k++] = a[j++];  
      
    for (i = 0; i < k; i++)  
        a[left + i] = temp[i];  
}  

int mergesort(int a[], int left, int right, int temp[])  
{  
    if (left < right)  
    {  
        int mid = (left + right) / 2;  
        mergesort(a, left, mid, temp);     
        mergesort(a, mid + 1, right, temp); 
        mergearray(a, left, mid, right, temp); 
    }  
}  
 
int main()
{
	int *p=new int[8];
	int left=0;
	int right=7;
	mergesort(arr,0,7,p);
	delete[] p;
	for(int i=0;i<=7;i++)
	printf("%d ",arr[i]);