归并排序
归并排序(MERGE-SORT)是建立在归并操作上的一种有效的排序算法,该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。将已有序的子序列合并,得到完全有序的序列;即先使每个子序列有序,再使子序列段间有序。若将两个有序表合并成一个有序表,称为二路归并。
归并排序模拟排序过程
图片(注:百度搜索而来的图片)链接: link.
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-4bt2pYUK-1650291757852)(https://timgsa.baidu.com/timg?image&quality=80&size=b9999_10000&sec=1555995484611&di=1f25f772472a735ca8f34827d72a9afb&imgtype=0&src=http%3A%2F%2Fimg.mp.itc.cn%2Fq_70%2Cc_zoom%2Cw_640%2Fupload%2F20160918%2Fe5ea6b39c1de455aba579e7742128752_th.gif)]
java代码实现
// An highlighted block
public class MergeSortTest {
/**
* 合并的过程
*
* @param arr
* @param low
* @param mid
* @param high
*/
private static void _merge(int[] arr, int low, int mid, int high, int[] temp) {
for (int i = low; i <= high; i++) {
temp[i] = arr[i];
}
int left = low; //左边的指针
int right = mid + 1;//右边的指针
for (int k = low; k <= high; k++) {
// 如果 左边的指针超过中间边界
if (left > mid) {
arr[k] = temp[right];
right++;
} else if (right > high) { // 如果 右边的指针超过最右边界
arr[k] = temp[left];
left++;
} else if (temp[left] < temp[right]) {
arr[k] = temp[left];
left++;
} else {
arr[k] = temp[right];
right++;
}
}
}
/**
* 分割
*
* @param arr
* @param left
* @param right
*/
private static void _mergeSort(int[] arr, int left, int right, int[] tmp) {
if (left >= right) return;
int mid = (left + right) / 2;
_mergeSort(arr, left, mid, tmp);
_mergeSort(arr, mid + 1, right, tmp);
_merge(arr, left, mid, right, tmp);
}
public static void sort(int[] arr, int n) {
int[] tmp = new int[arr.length];
_mergeSort(arr, 0, n - 1, tmp);
}
public static void main(String[] args) {
int[] arr = new int[]{3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48};
sort(arr, arr.length);
int i;
String separator = " <= ";
for (i = 0; i < arr.length - 1; i++) {
System.out.print(arr[i] + separator);
}
System.out.println(arr[i]);
// 2 <= 3 <= 4 <= 5 <= 15 <= 19 <= 26 <= 27 <= 36 <= 38 <= 44 <= 46 <= 47 <= 48 <= 50
}
}
时间复杂度
O(nlogn)