摘要:
#include#include#includevoid Insertion(int arr[],int n){ int i,j,tmp; for(i=1;i0&&tmp=r) return; c=(l+r)/2; MergeSort(arr,l,c); MergeSort(arr,c+1,r); Merge(arr,l,c,r);}void Bubbling(int a[],int n){ int i,j,tmp; for(i=1;i0&&a[j-1]>tmp;--j) a[j]=a[j-1]; a[j]=tmp; }}int partition(int 阅读全文