Lossless compression of bit strings using Huffman coding. Huffman encoding assigns a binary value to each character, with the shortest binary value representing the most commonly used character.

Reads a file or directory, parses words, adds them to a dictionary, and saves it as a file that can be read by the flashcards script.

• Quizzes the user based on a dictionary of terms. The user can add terms manually or from a single file. Can use files produced by dictionaryMaker.

Calculates the sum of all even numbers that are in the fibonacci sequence under a certain number.

A recursive flood-fill algorithm. Uses floodmap1.txt and floodmap2.txt

A simple priority queue, also used in the huffman encoder.