3 ms·
It's not just slow but it wouldn't be compression either. On average, the length of the number required to point to the starting digit will be the same length
by crazygringo 6y ago
It's not just slow but it wouldn't be compression either.
On average, the length of the number required to point to the starting digit will be the same length as the data you're trying to compress.
It would be 0% compression in the long run.
- treesprite82 6y ago> On average, the length of the number required to point to the digit will be the same length as the data you're trying to compress. It would be 0% compression in the long run Worse than 0%. The average position of numbers 0000-9999 in pi is 9940, for example. I believe ideally you'd want a De Bruijn sequence (https://en.wikipedia.org/wiki/De_Bruijn_sequence https://en.wikipedia.org/wiki/De_Bruijn_sequence - "optimally short with respect to the property of containing every string of length n at least once") but even that won't get 1:1 compression.