Pages

01 January, 2024

Compression of randomly ordered non-repeating incremental integers

I have a set of 100 integers from 0-99 in random order. Each number in the range occurs exactly once. I am looking for the most effective lossless compression algorithm to compress this data while maintaining the ability to decompress it efficiently?


I know that compressing random numbers is theoretically not possible, but I'm wondering if it's possible for this case since each number only appears once and you basically just need to compress the order of the numbers somehow... Please don't be harsh, I'm not an expert in this field. Also, any tips for python implementations would be greatly appreciated! :)


Thanks in advance.

No comments:

Post a Comment

Thanks