基础算法(1)快速排序，归并排序

码码呼呼的研究牲

已于 2023-04-23 10:53:58 修改

阅读量32

点赞数 1

文章标签： c++ Powered by 金山文档

于 2023-03-20 15:35:12 首次发布

本文链接：https://blog.csdn.net/m0_56277671/article/details/129668641

版权

文章展示了两种经典的排序算法——快速排序和归并排序的实现过程，包括分界点确定、递归处理和排序合并。此外，还提到了使用库函数sort的简洁方式。

摘要由CSDN通过智能技术生成

Acwing785.快速排序

确定分界点：q(l),q(r),q(l+r/2),随机数

调整区间（重点）

递归处理左右两段

#include <iostream>

using namespace std;

const int N = 1e6+10;

int n;
int q[N];

void quick_sort (int q[],int l, int r)
{
    if (l >= r) return;//不用排序
    int i = l-1, j = r+1;
    int x = q[l];
    while (i < j)
    {
        do i++ ;while (q[i] < x);
        do j-- ;while (q[j] > x);
        if (i < j) swap(q[i],q[j]);
    }
    quick_sort(q,l,j);
    quick_sort(q,j+1,r);

}

int main()
{
    scanf("%d",&n);
    for (int i = 0; i < n; i++) scanf ("%d",&q[i]);
    quick_sort (q,0, n-1);
    for (int i = 0; i < n; i++) printf ("%d",q[i]);
    return 0;
}

Acwing787.归并排序

确定分界点：mid = (l+r)/2

递归排序left，right

归并排序合二为一(难点）

#include <iostream>

using namespace std;

const int N = 1e6+10;

int n;
int q[N],tmp[N];

void merge_sort (int q[],int l, int r)
{
    if (l >= r) return;//不用排序
    int mid = (l+r) / 2;
    merge_sort(q,l,mid) , merge_sort(q,mid+1,r);
    //需要结果数组tmp
    int k = 0,i = l,j = mid + 1;
    while (i <=mid && j <= r)
        if (q[i] <= q[j]) tmp[k++] = q[i++];
    else tmp[k++] = q[j++];
    while(i <= mid ) tmp[k++] = q[i++];
    while(j <= r) tmp[k++] = q[j++];

    for (int i = l,j = 0;i <= r; i++,j++) q[i] = tmp[j];

}

int main()
{
    scanf("%d",&n);
    for (int i = 0; i < n; i++) scanf ("%d",&q[i]);
    merge_sort (q,0, n-1);
    for (int i = 0; i < n; i++) printf ("%d ",q[i]);
    return 0;
}

用库函数

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1e6+10;

int n;
int q[N];
//int tmp[N];

//void merge_sort (int q[],int l, int r)
//{
//    if (l >= r) return;//不用排序
//    int mid = (l+r) / 2;
//    merge_sort(q,l,mid) , merge_sort(q,mid+1,r);
//    //需要结果数组tmp
//    int k = 0,i = l,j = mid + 1;
//    while (i <=mid && j <= r)
//        if (q[i] <= q[j]) tmp[k++] = q[i++];
//    else tmp[k++] = q[j++];
//    while(i <= mid ) tmp[k++] = q[i++];
//    while(j <= r) tmp[k++] = q[j++];
//
//    for (int i = l,j = 0;i <= r; i++,j++) q[i] = tmp[j];
//
//}

int main()
{
    scanf("%d",&n);
    for (int i = 0; i < n; i++) scanf ("%d",&q[i]);
    sort (q,q+n);//库函数
    for (int i = 0; i < n; i++) printf ("%d ",q[i]);
    return 0;
}