If you are asking for sorting in a hash table, then you do not know what a hash table is. If you sort a hash table, then it is no longer a hash table, it is just a random collection of data. If you sort it, it will be come immeasurably slow. If you want it sorted, then you don't use a hash table to store it. Data structures have limits, if they could all do the same exact thing, then multiple structures wouldn't exist. Hash tables are designed to optimize search time. NOT to allow reorganization. In fact, reorganizing a hash table breaks the algorithms and it would no longer be a hash table. It would be like saying I have a car, but instead of driving it on land, I want it to fly. Well then you are no longer talking about a car, you are talking about a plane. They are not the same thing. In the same respect, a hash table and a sorted list are not the same thing. You can't simply make one act like the other.
