>Well let me tell yo the deal
>I am trying to dir a set of files in a directory and sort them in a way that
>always the newest ones are at the top of this list, then choose the newest one
>and get on with the process.. I got the sort work out but the Asort descending option is proving to be a real pain ing the be#$$^ind..
>Any suggestions
>
>Mark Oliva

Why don't you simply write a loop to copy the array backwards into another array? Like this:

dime copy_array (same as old array) 
lnn=alen(old_array,1)
for i=1 to lnn
       for j=1 to alen(old_array,2)     && this should give columns, right?
             copy_array[n+1-i, j]=old_array[i,j]
       endfor
endfor

Not the most elegant code of all times, but...