Sorting Files for Better Compression

Sorting files by similarity hash increases the odds a (small window) compression algorithm will succeed at matching more repetitive data.

The example has many copies of Audacity projects where audio is mostly the same but the files are repeated for every copy of the project.