Java 基数排序,r的值
基数排序请参考以下代码:Java 基数排序,r的值,java,data-structures,bit-manipulation,radix-sort,Java,Data Structures,Bit Manipulation,Radix Sort,基数排序请参考以下代码: class RadixSort { public static void radix_sort_uint(int[] a, int bits) { int[] b = new int[a.length]; int[] b_orig = b; int rshift = 0; for (int mask = ~(-1 << bits); mask != 0; mask <
class RadixSort
{
public static void radix_sort_uint(int[] a, int bits)
{
int[] b = new int[a.length];
int[] b_orig = b;
int rshift = 0;
for (int mask = ~(-1 << bits); mask != 0; mask <<= bits, rshift += bits) {
int[] cntarray = new int[1 << bits];
for (int p = 0; p < a.length; ++p) {
int key = (a[p] & mask) >> rshift;
++cntarray[key];
}
for (int i = 1; i < cntarray.length; ++i)
cntarray[i] += cntarray[i-1];
for (int p = a.length-1; p >= 0; --p) {
int key = (a[p] & mask) >> rshift;
--cntarray[key];
b[cntarray[key]] = a[p];
}
int[] temp = b; b = a; a = temp;
}
if (a == b_orig)
System.arraycopy(a, 0, b, 0, a.length);
}
}
这是从维基百科下载的
我觉得该算法只适用于完全除以32的bits参数值。因此,位应该是2或4,而不是10。如果我是对的,请告诉我。简短回答:不
长答覆:
可能的混淆线是:
for (int mask = ~(-1 << bits); mask != 0; mask <<= bits, rshift += bits) {
面具