java - which one is better to sort linked items , Hashmap or linkedhashmap or any other? -
i have 2 strings twitter json "follower_count" , "user id"
i need sort them according favourite count in descending order, i.e greater follower count gets placed first , access "user id" link. , print 1 10.
best way in java/android hashmap or linked hashmap or other ?
update:- used sorted maps suggested, treemap
here progress far:
//get first status status = statuses.get(0); //get id of status long l= status.getid(); //get retweeters id ki =twitter.getretweeterids(l, 100, -1); long[] id=ki.getids(); //for every retweeter id, followers count , put in treemap treemap<integer,long> tm = new treemap<integer, long>(); for(int k=0;k<=id.length;k++) { u = twitter.showuser(id[k]); follower=u.getfollowerscount(); tm.put(follower,id[k] ); } navigablemap<integer,long> reversetreemap = tm.descendingmap();
have tried sortedmap? provides ordering on keys. http://docs.oracle.com/javase/7/docs/api/java/util/sortedmap.html
Comments
Post a Comment