// 归并排序---非递归publicstaticvoidmergeSort(int[] arr){int n = arr.length;for(int i =1; i < n; i *=2){for(int j =0; j < n; j +=2* i){int l = j;int mid = l + i -1;int r = mid + i;//如果计算出的mid和r值大于数组下标最大值,就让它等于数组下标if(mid > n -1){
mid = n -1;}if(r > n -1){
r = n -1;}}}}