会python真的可以为所欲为0(回)
381天前
这里还有人吗1(回)
566天前这里还有人吗0(回)
566天前
每天面对着电脑屏幕，敲打键盘。我所面对的并不只是代码，而是一种生活方式。0(回)
791天前到处都是羊，不想上班0(回)
871天前
鸽子
0(回)
875天前package org.rut.util.algorithm.support; |
import org.rut.util.algorithm.SortUtil; |
/** |
* @author treeroot |
* @since 2006-2-2 |
* @version 1.0 |
*/ |
public class ImprovedMergeSort implements SortUtil.Sort { |
private static final int THRESHOLD = 10; |
/* |
* (non-Javadoc) |
* |
* @see org.rut.util.algorithm.SortUtil.Sort#sort(int[]) |
*/ |
public void sort(int[] data) { |
int[] temp=new int[data.length]; |
mergeSort(data,temp,0,data.length-1); |
} |
private void mergeSort(int[] data, int[] temp, int l, int r) { |
int i, j, k; |
int mid = (l + r) / 2; |
if (l == r) |
return; |
if ((mid - l) >= THRESHOLD) |
mergeSort(data, temp, l, mid); |
else |
insertSort(data, l, mid - l + 1); |
if ((r - mid) > THRESHOLD) |
mergeSort(data, temp, mid + 1, r); |
else |
insertSort(data, mid + 1, r - mid); |
for (i = l; i <= mid; i++) { |
temp[i] = data[i]; |
} |
for (j = 1; j <= r - mid; j++) { |
temp[r - j + 1] = data[j + mid]; |
} |
int a = temp[l]; |
int b = temp[r]; |
for (i = l, j = r, k = l; k <= r; k++) { |
if (a < b) { |
data[k] = temp[i++]; |
a = temp[i]; |
} else { |
data[k] = temp[j--]; |
b = temp[j]; |
} |
} |
} |
/** |
* @param data |
* @param l |
* @param i |
*/ |
private void insertSort(int[] data, int start, int len) { |
for(int i=start+1;i<start+len;i++){ |
for(int j=i;(j>start) && data[j]<data[j-1];j--){ |
SortUtil.swap(data,j,j-1); |
} |
} |
} |
} |
