(一)课程截图
(二)课程笔记
https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html
推荐一个数据结构可视化网站,可以看到归并排序的推理过程
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, tmp[r - l + 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(k = 0, i = l; i <= r; k++, i++) q[i] = tmp[k];
}
作者:clearlife
链接:https://www.acwing.com/solution/content/16778/
来源:AcWing
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
(三) 算法模板
#include<iostream>
using namespace std;
const int maxn=1e6+10;
int q[maxn];
int temp[maxn];
int n;
void merge_sort(int q[],int l,int r){
if(l>=r) return;
int mid = l+r>>1;
int i=l,j=mid+1;
int k=0;
merge_sort(q,l,mid);
merge_sort(q,mid+1,r);
while(i<=mid && j<=r){
if(q[i]<=q[j]){
temp[k++]=q[i++];
}
else{
temp[k++] =q[j++];
}
}
while(i<=mid) temp[k++] =q[i++];
while(j<=r) temp[k++] =q[j++];
for(int i=l,j=0;i<=r;i++,j++){
q[i] =temp[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]);
}
}
参考:
【1】作者:clearlife
链接:https://www.acwing.com/solution/content/16778/
来源:AcWing