归并排序,时间复杂度为O(nlogn)空间复杂度,
需要 O(n)
额外空间
public class MergeSortBlog {
public void merge(int[] a,int first,int mid,int last,int[] temp) {
int i=first,j=mid+1;
int m=mid,n=last;
int k=0;
while(i<=m&&j<=n) {
if(a[i]<=a[j]) {
temp[k++]=a[i++];
}else {
temp[k++]=a[j++];
}
}
while(i<=m) {
temp[k++]=a[i++];
}
while(j<=n) {
temp[k++]=a[j++];
}
for( i=0;i<k;i++) {
a[first+i]=temp[i];
}
}
public void mergeSort(int[] a,int first,int last,int[] temp) {
if(first<last) {
int mid=(first+last)/2;
mergeSort(a,first,mid,temp);
mergeSort(a,mid+1,last,temp);
merge(a,first,mid,last,temp);
}
}
public static void main(String[] args) {
int[] a= {0 ,5,3,1,4,6};
int temp[]=new int[6];
MergeSortBlog mergeSortBlog=new MergeSortBlog();
mergeSortBlog.mergeSort(a,0,a.length-1,temp);
for(int i=0;i<a.length;i++) {
System.out.print(a[i]+" ");
}
}
public class MergeSortBlog {
public void merge(int[] a,int first,int mid,int last,int[] temp) {
int i=first,j=mid+1;
int m=mid,n=last;
int k=0;
while(i<=m&&j<=n) {
if(a[i]<=a[j]) {
temp[k++]=a[i++];
}else {
temp[k++]=a[j++];
}
}
while(i<=m) {
temp[k++]=a[i++];
}
while(j<=n) {
temp[k++]=a[j++];
}
for( i=0;i<k;i++) {
a[first+i]=temp[i];
}
}
public void mergeSort(int[] a,int first,int last,int[] temp) {
if(first<last) {
int mid=(first+last)/2;
mergeSort(a,first,mid,temp);
mergeSort(a,mid+1,last,temp);
merge(a,first,mid,last,temp);
}
}
public static void main(String[] args) {
int[] a= {0 ,5,3,1,4,6};
int temp[]=new int[6];
MergeSortBlog mergeSortBlog=new MergeSortBlog();
mergeSortBlog.mergeSort(a,0,a.length-1,temp);
for(int i=0;i<a.length;i++) {
System.out.print(a[i]+" ");
}
}
}
结果: