July 5, 201510 yr You can't sort a hashmap.. It's hashed.. A priority queue would be your best bet IMO, depending on the situation ofc. Make a wrapper class to hold your 2 ints, let the wrapper class implement the comparable interface (compare by key value), and they'll be automatically sorted as you insert them into the PQ Yea I told him that in a pm haha. Cant sort a hash map, and he doesnt really need one for what he is doing either.
Create an account or sign in to comment