[RESOLVED] Which one is more efficient in terms of collection sorting?

[oceanebelle]

for example, using the following:

the collection Set and sorting as we go.

Set sortedObject= new TreeSet<SomeObject>(comparator);

or

the collection list and sorting when all elements are in the list.

Collections.sort(list, comparator);

what are the adv and disadv in terms of memory usage and execution time?