Java best data structure for sorting? [closed]

Question

Closed. This question is opinion-based. It is not currently accepting answers.

---

Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.

Closed 8 years ago.

Improve this question

I want to store a list of (Object, int) in a data structure such that the int field can be easily sorted (ascending or descending). I'm looking at Hashtables and TreeMaps but i'm unsure which, if either, of these are good for this purpose. The priority is the sort speed. Any suggestions?

Answer 1

Given what you've told us, it's hard to say what'd be best.

If you're concerned with sorting performance alone, a HashTable or TreeMap (actually a red-black binary tree) have great sorting performance, but they're slower than some other data structures when adding (and in TreeMap's case, deleting) items.

You should probably provide more details regarding what you're doing with the data.