logo

SEE ALGORITHMS

    Bubble SortInsertion SortSelection SortRadix SortHeap SortMerge SortQuick Sort
    Depth First SearchBreadth First SearchPrim's AlgorithmKruskal's AlgorithmDijkstra's AlgorithmTopological SortingHamiltonian Cycle
    Binary Search TreeBinary HeapCircular Queue
Other
    Convex HullHuffman Coding
Huffman Coding

Huffman Coding is a lossless data compression algorithm that reduces the size of data by assigning shorter binary codes to more frequent symbols. It builds an optimal prefix tree, ensuring efficient encoding and decoding. Commonly used in file compression formats like ZIP and JPEG, Huffman Coding minimizes storage space without losing information.