Added new data file
Changed all unsigned char to char.
Removed use of vector in BWT transform to try and improve memory usage.
Wrote new sort function that sorts a 2D array... for use in the BWT transform.
Code still takes same amount of memory as before and is much slower.
Changed all unsigned char to char
Changed BWT transform back to using vectors instead of arrays. Arrays were not much more efficient.
Figured out source of code inefficiency:
   - The 2D vector that stores all rotations is taking a MASSIVE amount of memory when the number of input elements is significant (>10000).
   - This is because it's a 2D vector, so it has to allocate the SQUARE of the number of elements.
   - When testing an input file with 87,650 elements, that means over 7.5GB of memory allocated.
   - Additionally, this allocation takes the vast majority of the program's running time (>95%).
   - This issue was hidden when testing with smaller input arrays (<100 elements) as they do not require nearly the same amount of memory.
Fixed the performance bug. 2D vector in BWT now only uses first 10 elements + last element.
Deleted unnecessary commented-out code and debug print statements.
Flipped the verbose output operation. Now defaults to 'quiet' with option 'v' to enable verbose mode
Cleaned up more commented-out debug print statements. Also added comments for the rest of the Huffman coding process
Moved the output data vector from decompress_gold to test_decompress... now passed as a pointer in computeDecompressGold()
Changed char to unsigned char again, to accomodate all ASCII characters 0-255 (including extended)