3
Watch
4
Star
3
Fork
0
Issue

Huffman compression algorithm in C

projetosufal
projetosufal
pushedAt 3 years ago

projetosufal/data-structures-project

Data structure projects

Project

Description

This project is divided in tree parts

  • A presentation about Segment tree - an algorithm not seen in class
  • A fully functional huffman algorithm, well documented
  • Simple algorithm complexity comparison - Priority queues with and without Heaps

Segmentation tree

Huffman

Usage

Clone this rep.

$ git clone https://github.com/projetosufal/data-structures-project

use make to build binaries

$ make

Progress Track

  • [X] Documentation [1/1]
    • [X] Every ADT
  • [X] Huffman algorithm [3/3]
    • [X] Compress files
    • [X] Extract files
    • [X] Structures done with pointer to void
  • [X] Write unitary cases for every data structure [1/1]
    • [X] Cunit tests
  • [X] Program [1/1]
    • [X] MakeFile

Priority Queue - With vs. Without Heap

ucloud ads