hermanos les ajusto el codigo

public static void radixSort(int a[]){
if(a.length == 0)
return;
int[][] np = new int[a.length][2];
int[] q = new int[0x100];
int i,j,k,l,f = 0;
for(k=0;k<4;k++){
for(i=0;i<(np.length-1);i++)
np[1] = i+1;
np[1] = -1;
for(i=0;i<q.length;i++)
q = -1;
for(f=i=0;i<a.length;i++){
j = ((0xFF<<(k<<3))&a)>>(k<<3);
if(q[j] == -1)
l = q[j] = f;
else{
l = q[j];
while(np[l][1] != -1)
l = np[l][1];
np[l][1] = f;
l = np[l][1];
}
f = np[f][1];
np[l][0] = a;
np[l][1] = -1;
}
for(l=q[i=j=0];i<0x100;i++)
for(l=q;l!=-1;l=np[l][1])
a[j++] = np[l][0];
}
}

lo que sucede es que no logro comperder el codigo, me podrian ayudar? saludos y gracias hermanos