I always wanted this feature and saw there was also an item about it in the issue list.
After finding all the duplicate files, the list only has to be sorted by the size of those. I think mergesort is the best choice for the sorting algorithm because no memory has to be dynamically allocated and worst runtime is still O(n log (n)). I added the command line option -z or --sortbysize.
It worked without problems on the examples I tested.
I always wanted this feature and saw there was also an item about it in the issue list. After finding all the duplicate files, the list only has to be sorted by the size of those. I think mergesort is the best choice for the sorting algorithm because no memory has to be dynamically allocated and worst runtime is still O(n log (n)). I added the command line option -z or --sortbysize. It worked without problems on the examples I tested.
Btw, thanks for the awesome work on fdupes!