New Blog Articles

by Chad Germany

Huffman Encoding

Huffman Encoding is a technique of compressing data to reduce its size without losing any of the details. Huffman Coding is generally useful to compress the data in which there are frequently occurring characters. The most frequent character gets the smallest code and the least frequent character gets the largest code. Read More ›

More Articles


Every other week, one of us will learn an algorithm, present and upload a brief summay.

More ›


We meet every other Thusday from 1:00-2:00 pm CST in Loomis 322.

More ›


We will archive covered algorithms here, as well as post potentially interesting algorithms to be covered.

More ›