sorting a hash map without creating a new treemap

Hi all,
I have following questions:
1)Is there any other way to sort a hashmap(based on key ordering) without using treemap?
2)IF there is a way to sort a hashmap without creating a new instance of treemap,so it is consume lots of time as compare to sorting it with creating a new of treemap??

Please help me to solve my puzzle.
Thanks in advance:


You are reading an archived discussion.

Related Posts

Hello Every body.........
True Caller is a global Caller ID app that shows you who the caller is before you answer! - Caller ID, see who is calling - Social Caller ID, see...
Hello CEs, I want to do a project using TMSC6713 DSP processor kit as my final year project.Hence i request all CEs to give ideas regarding the projects which can...
Yesterday i was working on some project and my boss asked me to implement UUID in database instead of primary key I was not aware of uuid so i searched...
i m searching for best engineering college in UP😁