2 ms·
But you only need to decode it once (or otherwise receive those indices without even deciding) whereas random access to a rope/tree is always o(log n) or o(n).
by beagle3 9y ago
But you only need to decode it once (or otherwise receive those indices without even deciding) whereas random access to a rope/tree is always o(log n) or o(n).
Use case is everything.
- fnord123 9y ago>Use case is everything. amen.