als anregung (nicht getestet):
function sort(a)
{
res = new Array();
while(a.length > 0)
{
i = Math.Round(Math.Random()*(a.length-1));
res[res.length] = a[i];
a = Delete(a,i)
}
return(a);
}
function Delete(a,i)
{
for(j=i;j<a.length-1;j++){a[j] = a[j+1];}
a.length = a.length-1;
return(a);
}
gruss,
frank_eee.