function Sort(c)//快速排序法
{
ss=c.split(",");
l=0;
h=(ss.length-1);
temp=ss[0];
str1="";
while(l<h)
{
while(l<h&&parseInt(ss[h])>temp)
{
h--;
}//while
ss[l]=ss[h];
while(l<h&&parseInt(ss[l])<temp)
{
l++;
}//while
ss[h]=ss[l];
}//while
ss[l]=temp;
for(j=0;j<ss.length;j++)
{if(j==ss.length-1)
str1=str1+ss[j];
else
str1=str1+ss[j]+",";
}
return str1;
}
{
ss=c.split(",");
l=0;
h=(ss.length-1);
temp=ss[0];
str1="";
while(l<h)
{
while(l<h&&parseInt(ss[h])>temp)
{
h--;
}//while
ss[l]=ss[h];
while(l<h&&parseInt(ss[l])<temp)
{
l++;
}//while
ss[h]=ss[l];
}//while
ss[l]=temp;
for(j=0;j<ss.length;j++)
{if(j==ss.length-1)
str1=str1+ss[j];
else
str1=str1+ss[j]+",";
}
return str1;
}