Time complexity

Both the compression and decompression algorithms require time on the order of $O(n)$, where $n$ specifies the linear size of the input. In other words, both algorithms are linear, and can compress and decompress data quickly.

Hosted by www.Geocities.ws