归并排序

最新推荐文章于 2024-03-26 17:18:09 发布

微凉code

最新推荐文章于 2024-03-26 17:18:09 发布

阅读量85

点赞数 1

文章标签： f

本文链接：https://blog.csdn.net/qq_41921315/article/details/82964942

版权

熟悉归并排序代码

public class MergeSort {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		int[] list= {2,3,2,5,6,1,-2,3,14,12};
		mergeSort(list);
		for(int i=0;i<list.length;i++) {
			System.out.print(list[i]+"  ");
		}
	}

	public static void mergeSort(int[] list) {
		if(list.length>1) {
			
			//Merge sort the first half
			int[] firsthalf=new int[list.length/2];
			System.arraycopy(list, 0, firsthalf, 0, list.length/2);
			mergeSort(firsthalf);
			
			//Merge sort the second half
			int[] secondhalf=new int[list.length-list.length/2];
			System.arraycopy(list, list.length/2, secondhalf, 0, list.length-list.length/2);
			mergeSort(secondhalf);
			
			//merge firsthalf with secondhalf into list
			merge(firsthalf,secondhalf,list);
		}
	}
	public static void merge(int[] list1,int[] list2,int[] temp) {//归并
		int current1=0;
		int current2=0;
		int current3=0;
		
		while(current1<list1.length && current2<list2.length) {
			if(list1[current1]<list2[current2])
				temp[current3++]=list1[current1++];
			else
				temp[current3++]=list2[current2++];
		}
		
		while(current1<list1.length)
			temp[current3++]=list1[current1++];
		while(current2<list2.length)
			temp[current3++]=list2[current2++];
	}
}