How do I optimize Heap sort being used in sorting Class objects for Burrows Wheeler Transform?

Question

I am trying to implement the burrows wheeler`s transform. I have a Dictionary class which contains index (int) and data (string). The Dictionary class is being used to build