From: address@nospicedham.not.available   
      
   Bilal Ahmad,   
      
   > Huffman algo and other algos are possible in high level languages,   
      
   And in low-level languages (Assembly) too.   
      
   For the record: If something can be implemented in a high-level language   
   than it can also be created in a low-level one - because all high-level   
   languages we know are (directly or indirectly) implemented in low-level   
   languages.   It just takes more work.   
      
   > But how can we implement compression at at bit level?   
      
   I hope you mean "byte" level here, as I do not know of any processor which   
   has a bit-sized smallest storage unit (though I seem to remember that there   
   where a few bitstream processors - mostly used in calculators).   
      
   In the chance you ment to ask "how do I implement Huffman encoding in   
   Assembly", why didn't you just ask Google ?:  "huffman encoding assembly"   
   (without the doublequotes).   (actually, throwing the "how do I ..." line   
   into Google works too.  :-) )   
      
   It looks like that   
   https://programmer209.wordpress.com/2015/07/30/fasm-huffman-encoding/   
   is probably what you are looking for.   
      
   These ones (a few spots down)   
   https://www.experts-exchange.com/questions/26256462/Huffman-Comp   
   ession-and-decompression-code-on-assembly-language.html   
   https://stackoverflow.com/questions/43228987/text-compressing-assembly-language   
   look good too.   
      
   Regards   
   Rudy Wieser   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)