title: Big O complexities of algorithms - LZW and Huffman
body: <p>What are the space and time complexities, in Big O notation, for the Lempel-Ziv-Welch and Huffman compression algorithms? Google is failing me.</p>
  
  <p>Thanks,</p>
  
  <p>Francisco</p>