快速排序(快排)
思想--分治
- 确定边界:q[l], q[(l+r)/2], q[r], 随机均可
- 划分范围:左边为<=x放到a[]里, 右边为>=x放到b[](重要)
- 左右两段处理排序--递归
方法:
*i指向第一个数向右走遇到第一个>x的数,*j指向最后一个数向左走遇到第一个<x的数,*i和*j交换,递归上述行为,直至*i和*j相遇。
模板:
void quick_sort(int q[], int l, int r)
{
if(l >= r)return;
int x = q[l], i = l-1, j = r + 1;
while(i<j)
{
do i ++; while(q[i] < x);
do j --; while(q[j] > x);
if(q[i] < q[j])swap(q[i], q[j]);
}
quick_sort(q, l, j);
quick_sort(q, j+1, r);
}
代码示例:
#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 x = q[l], i = l-1, j = r + 1;
while(i<j)
{
do i ++; while(q[i] < x);
do j --; while(q[j] > x);
if(q[i] < q[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;
}
归并排序
思想--分治
- 确定分界点:mid=(l+r)/2
- 递归排序左边和右边
- 归并:合二为一(重要)
模板:
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];
}
代码示例:
#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 >> 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]);
return 0;
}
库模板
#include<algorithm>
sort(q, q + n);//sort(始, 末)均为指针