4 ms·
Simple! 0. Write oh hi :D, get link0 1. Paste link0, get link1 2. Paste link1, get link2 ... Encoding goes E(T), E(E(T)), etc. let K be the per-char encodin
by sterlind 8y ago
Simple!
0. Write oh hi :D, get link0
1. Paste link0, get link1
2. Paste link1, get link2
...
Encoding goes
E(T), E(E(T)), etc. let K be the per-char encoding overhead, so E(T) = KT: complexity is O(K^N * T) where N is number of levels and T is length of text at level 0!
- flyGuyOnTheSly 8y agoD'oh! You're right! That IS simple!