• greedy/optimal algorithm

• uses lots of data structures

  • priority queues - efficient for insert and deletemin

  • binary trees

  • tables

  • read bits-at-atime