I think what KT is reffering to is the order recieved in the FindFirtsFile and FindNext functions. These are completly independant of the way you sort them in explorer. KT's idea would of course work but it would be completly unuseable. despite the obvious large amounts of memry required the time to completion would be astronomical.
first your listing all the files in memory this is the same time you normally have. then you sort that internal list wich could take a large amount of time. then give the list (one item at a time) back to the script.
If im not mistaken there are methods of refining the FindNext etc.. functions (they use a struct as an arg). Perhaps that way you can get a more refined search
