二分查找排序算法.docxVIP

实验三 二路归并排序一、 实验目的1、 掌握二路归并算法；2、 根据二路归并设计应用实验并完成。二、 实验要求1、 设计二路归并的应用实验；2、 写出相应程序；3、 保存和打印出程序的运行结果，并结合程序进行分析。三、实验内容1.问题设计：设计一个可以测试二路归并算法效率的程序，该程序可以计算10^2—10^8数量级间排序的时间和数量级每增加10倍时时间翻了几倍，并且可以记录并打印20倍以上突变的数量级。2.问题分析：排序函数能够将给定的数组里面的数值进行二分归并排序，根据需要设计函数 mergeSort(); //递归进行划分并在函数里调用排序函数 merge(); //对进行划分了的数组进行排序和合并到tmp数组中3.算法： void merge(long *arr, long low, long mid, long high){long *tmp = (long *)malloc((high - low + 1)*sizeof(long));long begin1 = low, begin2 = mid + 1, end1 = mid, end2 = high;for (k = 0; begin1 = end1begin2 = end2; k++){if (arr[begin1]arr[begin2]) tmp[k] = arr[begin1++];else tmp[k] = arr[begin2++];}while (begin1 = end1)tmp[k++] = arr[begin1++];while (begin2 = end2)tmp[k++] = arr[begin2++];for (i = 0; ihigh - low + 1; i++)arr[low + i] = tmp[i];free(tmp);}void mergeSort(long *arr, long low, long high){if (lowhigh){mid = (low + high) / 2;mergeSort(arr, low, mid);mergeSort(arr, mid + 1, high);merge(arr, low, mid, high);}}四、程序代码#includestdio.h#includestdlib.h#includetime.hvoid merge(long *arr, long low, long mid, long high){long i, k;long *tmp = (long *)malloc((high - low + 1)*sizeof(long));long begin1 = low, begin2 = mid + 1, end1 = mid, end2 = high;for (k = 0; begin1 = end1begin2 = end2; k++){if (arr[begin1]arr[begin2])tmp[k] = arr[begin1++];elsetmp[k] = arr[begin2++];}while (begin1 = end1)tmp[k++] = arr[begin1++];while (begin2 = end2)tmp[k++] = arr[begin2++];for (i = 0; ihigh - low + 1; i++)arr[low + i] = tmp[i];free(tmp);}void mergeSort(long *arr, long low, long high){long mid = 0;if (lowhigh){mid = (low + high) / 2;mergeSort(arr, low, mid);mergeSort(arr, mid + 1, high);merge(arr, low, mid, high);}}main(){int m = 3, b, log[4] = {\0}, n = 0;long i, j;long *arr;clock_t s, f;srand((unsigned)time(NULL));printf(测试二分归并算法的实际效率...\n);for (j = 1000; j = 100000000; j *= 10){arr = (long *)malloc(j*sizeof(int));for (i = 0; i j; i++)arr[i] = rand();s = clock();mergeSort(arr, 0, i-1);f = clock();free(arr);if (j != 1000 (f-s )/ b20) log[n++] = m;printf(当规模为 10