c#操作magick,magick.net
阿新 • • 發佈:2020-08-04
思路:
先將數列從中間分為兩段,並對兩段分別進行排序
利用遞迴的思想遍歷兩段數列中的數字並進行對比,然後合併在一起
模板:
void merge_sort(int q[],int l, int r) { if(l>=r) return; //int mid=l+r >> 1; int mid=(l+r)/2; 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=100000; 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 >> 1; int mid=(l+r)/2; 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; }