Mysteryy Posted July 5, 2015 Share Posted July 5, 2015 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. Quote Link to comment Share on other sites More sharing options...
Psvxe Posted July 6, 2015 Author Share Posted July 6, 2015 That's why I use a TreeMap. If people just read the whole thread.. Quote Link to comment Share on other sites More sharing options...