public class MergeSortMain {public static void main(String[] args) {int[] arr = {5, 4, 6, 2, 3, 7, 9, 1, 8};sort(arr);print(arr);}static void sort(int[] arr) {sort(arr, 0, arr.length - 1);}/*** @param arr 數(shù)組* @param leftBound 左邊界* @param rightBound 右邊界*/static void sort(int[] arr, int leftBound, int rightBound) {if (leftBound == rightBound) {return;}// 獲取右指針位置int rightPoint = leftBound + (rightBound - leftBound) / 2;// 左半部分排序sort(arr, leftBound, rightPoint);// 右半部分排序sort(arr, rightPoint + 1, rightBound);// 合并merge(arr, leftBound, rightPoint + 1, rightBound);}/*** @param arr 數(shù)組* @param leftPoint 左指針* @param rightPoint 右指針* @param rightBound 右邊界*/static void merge(int[] arr, int leftPoint, int rightPoint, int rightBound) {// 創(chuàng)建一個臨時數(shù)組int[] temp = new int[rightBound - leftPoint + 1];int mid = rightPoint - 1;int i = leftPoint;int j = rightPoint;// 臨時數(shù)組指針位置int k = 0;// 這樣子的循環(huán)條件出現(xiàn), 比如left arr都小于right arr時, left指針移動完成跳出循環(huán), right arr并將剩余數(shù)據(jù)插入臨時數(shù)組while (i <= mid && j <= rightBound) {// 判斷左邊小于右邊, 則放入臨時數(shù)組if (arr[i] < arr[j]) {temp[k] = arr[i];k++;i++;} else {temp[k] = arr[j];k++;j++;}}while (i <= mid) {// 左邊數(shù)組指針未移動完時temp[k] = arr[i];k++;i++;}while (j <= rightBound) {// 右邊數(shù)組指針未移動完時temp[k] = arr[j];k++;j++;}for (int l = 0; l < temp.length; l++) {arr[leftPoint + l] = temp[l];}}static void print(int[] arr) {for (int i : arr) {System.out.print(i + " ");}System.out.println(" ");} }

總結(jié)

以上是生活随笔為你收集整理的归并排序示例的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。