KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
If I have a Map like this: HashMap<Integer, ComparableObject> map; and I want to obtain a collection of values sorted using natural ordering, which method is fastest? (A) Create an instance of a sortable collection like ArrayList , add the values, then sort it: List<ComparableObject> sortedCollection = new ArrayList<ComparableObject>(map.values()); Collections.sort(sortedCollection); (B) Create an instance of an ordered collection like TreeSet , then add the values: Set<ComparableObject> sortedCollection = new TreeSet<ComparableObject>(map.values()); Note that the resulting collection is never modified, so the sorting only needs to take place once.
Tags (comma-separated)
Save Edits
Cancel