9种排序算法性能之比较之----归并排序

最新推荐文章于 2023-03-10 20:39:34 发布

pieagleye

最新推荐文章于 2023-03-10 20:39:34 发布

阅读量569

点赞数

分类专栏：编程语言数据结构与算法文章标签：排序算法归并排序

本文链接：https://blog.csdn.net/u011619200/article/details/40594963

版权

11 篇文章 0 订阅

订阅专栏

7 篇文章 0 订阅

订阅专栏

实现代码：

/*!

 * implemented by mengzhaofeng

*/

void merge_sort(int *data, int left, int right, int *temp)

    if(left == right) return ;

    if(right-left == 1) {

        if(data[left] > data[right]) {

            int tmp = data[left];

            data[left] = data[right];

            data[right] = tmp;

        return ;

    int m = ((left + right) / 2);

    merge_sort(data, left, m, temp);

    merge_sort(data, m+1, right, temp);

    //merge

    int i = left;

    int k = left;

    int j = m + 1;

    while(i <= m) {

        if(j <= right) {

            if(data[i] < data[j]) {

                temp[k++] = data[i++];

            } else {

                temp[k++] = data[j++];

        } else break;

    while(i <= m) {

        temp[k++] = data[i++];

    while(j <= right) {

        temp[k++] = data[j++];

    i = left;

    j = left;

    while(i <= right) {

        data[i++] = temp[j++];

/*!

 * 归并排序

*/

double MergeSort(int *data, int size)

    double res = 0;

    boost::scoped_array<int> temp(new int[size]);

    //EClock<> Ek;

    merge_sort(data, 0, size-1, temp.get());

    //res = Ek.microsecond();

    return res;

测试结果：

单位：us