Sorting recursive 'ls' and 'grep'
 

If you do for instance the following:
It will sort by file size. However the recursion is not done before the sorting - sorting will be grouped by subfolder, not consolidated.

Is there any way to sort in a consolidate fashion? Where the recursion to gather the file data is done first, and then all files are sorted together?

Could this work for your situation?

$ find . -iname '*.gif' -exec basename {} \; | sort

i.e. Find the .gifs, get the basename (filename minus directory), then pipe it all to sort.

Do you want to sort simply by the basename? You could use find instead. This example prints two entries per file, the basename and the full pathname and then uses sort to sort the output:

maybe?

Finds all, sorts by size, then directory/name



Cheers,
Tink

I want to sort by file size, and also sometimes by modification date. And so based on that, this works for file size:
And also for sorting by modification change time:
Yes that works :) (with -r added to sort) One problem is that filesize is printed in 1K blocks.

I prefer the find...-ls format to using -printf, but can -ls format be done with raw file size rather than file size in 1K blocks?

And is there any way to use the -ls format to sort by modification change time/status change time etc.?

In that case all you need to do is to invoke the *real* ls rather that using
finds built-in one. re-apply your -r to sort where ever needed ;}

Cheers,
Tink