When the sort is completed, is it more memory efficient to link the bins all together, then print out the results? Or, pop out all the results in order from each bin into a bin , then print the contents of the newly filled bin?
I feel sure that iterating through the bins will be more memory efficient than creating yet another data structure. Why the doubly linked list in each bin, do you ever need to interate in the reverse direction?
Years ago I wrote a parser in Java for big text files that was a hybrid of a MSC radix sort plus a Shell sort. The key point for speed and memory efficiency was that it never moved characters or created
String objects. Everything was done by moving pointers to
word starting characters in the buffer the text was read into treated as one huge character array.
Bill