【AcWing算法基础】第一讲 基础算法

虽然说有常用的模板，但是更习惯自己写的。

1、快速排序

1.1 快速排序

#include<iostream>
using namespace std;

const int N = 1e6+10;

int n;
int num[N];

void quick_sort(int num[],int l,int r)
{
   
    if(l>=r) return;
    
    int mid = (l+r+1)>>1;
    int x = num[mid],i = l-1,j = r+1;
    while(i<j){
   
        do i++; while(num[i]<x);
        do j--; while(num[j]>x);
        if(i<j) swap(num[i],num[j]);
    }
    quick_sort(num,l,i-1);
    quick_sort(num,i,r);
}

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

2.2 第k个数

#include<iostream>
using namespace std;

const int N = 1e6+10;
int n,k,q[N];

void quick_sort(int q[], int l, int r)
{
   
	if(l>=r) return;
	
	int x=q[l+r>>1],i=l-1,j=r+1;
	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%d",&n,&k);
	for(int i=0;i<n;i++) scanf("%d",&q[i]);
	
	quick_sort(q,0,n-1);
	
	printf("%d",q[k-1]);
}

2、归并排序

2.1 归并排序

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

const int N = 1e6+10;

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

void merge_sort(int q[], int l, int r)
{
   
    if(l>=r) return;
    
    int mid = l+r>>1;
    merge_sort(q,l,mid);merge_sort(q,mid+1,r);
    
    //归并
    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(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]);
}

2.2 逆序对的数量

#include<iostream>
using namespace std;

const int N = 1e6+10;
int n,q[N],tmp[N];

long long merge_sort(int l, int r)
{
   
    if(l>=r) return 0;
    
    int mid = l+r>>1;
    long long res = merge_sort(l,mid)+merge_sort(mid+1,r);
    
    //归并
    int i=l,j=mid+1,k=0;
    while(i<=mid && j<=r)
    {
   
        if(q[i]<=q[j]) tmp[k++] = q[i++];
        else
        {
   
            //逆序
            tmp[k++] = q[j++];
            res += mid-i+1;
        }
    }
    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];
    return res;
}

int main(