基数排序

function radixSort(c,n)
{
var arr1="";
var arr2="";
var arr3="";
var arr4="";
var arr5="";
var arr6="";
var arr7="";
var arr8="";
var arr9="";
var arr0="";
var str=new Array();
str=c.split(",");

for(i=0;i<str.length;i++)
{
m=str[i];

if(n<m.length)
s=m.charAt(parseInt(m.length)-n-1);
else
s=0;

switch(parseInt(s))
{
case 1:
arr1=arr1+str[i]+","

break
case 2:
arr2=arr2+str[i]+","

break
case 3:
arr3=arr3+str[i]+","

break
case 4:
arr4=arr4+str[i]+","

break
case 5:
arr5=arr5+str[i]+","

break
case 6:
arr6=arr6+str[i]+","

break
case 7:
arr7=arr7+str[i]+","

break
case 8:
arr8=arr8+str[i]+","

break
case 9:
arr9=arr9+str[i]+","

break
case 0:
arr0=arr0+str[i]+","

break
default:

break
}
}
strc=arr0+arr1+arr2+arr3+arr4+arr5+arr6+arr7+arr8+arr9;
strlen=strc.length
strc=strc.substr(0,strlen-1);
return strc;
}