An MD5 or SHA-256 sum would catch different files of the same size. However, they are computationally intense and in this use case overkill
Calculating the MD5 of a file should not be significantly slower than copying the file on a modern computer.
You could even optimize by delaying the MD5 calculation until you find a second file with same size and base name.
Alexander
In reply to Re^3: Finding old copies of files
by afoken
in thread Finding old copies of files
by Leitz
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |