Hello users,
I need to compress the following set of data:
1.TXT - AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2.TXT - AAAAAAAAAAAAA
3.TXT - AAAAAAAAAAAAAAAAAAAAAAAAA
4.TXT - AAAAAAAAAAAAA
5.TXT - AAAAAAAAAAAAAAAAAAAAAAAAAAAA
6.TXT - AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAA
7.TXT - AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
and so on...
Description: Each of text file consist of the same character (in this case it´s "A", but it can be replaced with any other symbols from ASCII table) that has been generated RANDOMLY by myself, but it this case randomness will be irrelevant, because it contains only one letter.
Filenames will be ordered descending.
My questions:
1. Since the aforementioned text files will be ordered descending, I suppose that I don´t need to store the filenames at all... it will be given directly from file content. Thus it COULD BE highly compressible, I suppose.
2. What about smart ordering algorithms? I mean: file "2.txt" and "4.txt" contains the same number of symbol, so it can be simplified... but I don´t know how.
3. If "A"´s would causing problems with compression ratio, it is, of course, possible to alter the string with any symbols (interleaving is also possible), but lenght must be preserved as it is.
Thanks a lot.