//归并排序
public class MergeSort {
// 不借助辅助数组实现
public void mergeSort(int[] data, int left, int right) {
if (left < 0 || right > data.length - 1 || left >= right) {
return;
}
int mid = (right - left) / 2 + left;
mergeSort(data, left, mid);
mergeSort(data, mid + 1, right);
int i = left;
int j = mid + 1;
int temp = 0;
while (i < j && j <= right) {
while (i < j) {
if (data[i] <= data[j]) {
i++;
} else {
break;
}
}
if (i == j) {
break;
}
temp = j;
while (j <= right) {
// 不能等于,否则会导致排序不稳定
if (data[i] > data[j]) {
j++;
} else {
break;
}
}
// 比如data = [1,4,5,10,2,4,7,8],此时i=1,temp=4,j=5
// 先变成[1,10,5,4,2,4,7,8]
reverse(data, i, temp - 1);
// 再变成[1,10,5,4,2,4,7,8]
reverse(data, temp, j - 1);
// 最后[1,2,4,5,10,4,7,8]
reverse(data, i, j - 1);
// j-temp是上一步参加翻转的第二组数据个数,i跳过它们,继续往下。
i += j - temp;
}
}
private void swap(int[] data, int left, int right) {
int temp = data[left];
data[left] = data[right];
data[right] = temp;
}
// 翻转数组
private void reverse(int[] data, int left, int right) {
if (left >= right) {
return;
}
while (left < right) {
swap(data, left, right);
left++;
right--;
}
}
// 借助辅助数组实现
public void mergeSort2(int[] data, int left, int right) {
if (left < 0 || right > data.length - 1 || left >= right) {
return;
}
// 先定义一个辅助数组,防止在递归中新建大量数组
int[] temp = new int[data.length];
mergeSort2(data, left, right, temp);
}
private void mergeSort2(int[] data, int left, int right, int[] temp) {
if (left == right) {
return;
}
int mid = (right - left) / 2 + left;
mergeSort2(data, left, mid, temp);
mergeSort2(data, mid + 1, right, temp);
int count = left;
int i = left;
int j = mid + 1;
while (i < mid + 1 && j <= right) {
while (i < mid + 1) {
if (data[i] <= data[j]) {
temp[count] = data[i];
count++;
i++;
} else {
break;
}
}
while (j <= right) {
if (data[i] > data[j]) {
temp[count] = data[j];
count++;
j++;
} else {
break;
}
}
}
// count小于等于right,说明有没填完的
if (count <= right) {
if (i < mid + 1) {
while (i < mid + 1) {
temp[count] = data[i];
count++;
i++;
}
} else {
while (j <= right) {
temp[count] = data[j];
count++;
j++;
}
}
}
// 把temp中排好的写入data中。
for (int k = left; k <= right; k++) {
data[k] = temp[k];
}
}
}
八大排序算法——归并排序(七)
最新推荐文章于 2024-10-20 15:56:23 发布