Sorting performance Arrays.sort() vs Collections.sort()

Many developer are concerned about the performance difference between java.util.Array.sort() java.util.Collections.sort() methods. Which one is faster? Which one to use and when?

performance "collections sort" in java, compare Array.sort() vs Collections.sort,compare Array.sort() versus Collections.sort which one is faster Arrays.sort or Collections.sort,Collection,Collectios,Colections,Collectons,
Collections sort implementation, Arrays sort implementation, comparison Arrays sort Collections sort, compare Arrays sort Collections sort method,compared, comparing, array sort Java, Java array sort

Well, both methods have same algorithm the only difference is type of input to them.

Collections.sort() has a input as List so it does a translation of List to array and vice versa which is an additional step while sorting.
So this should be used when you are trying to sort a list.

Arrays.sort is for arrays so the sorting is done directly on the array.
So clearly it should be used when you have a array available with you and you want to sort it.

Post a Comment Default Comments

  1. Thanks for sharing this, I always had a doubt on these two methods performance.

  2. They actually implement different algorithms. Check javadocs.


Individuals who comment on FromDev at regular basis, will be rewarded in Top Commenter section. (Comments are selectively moderated so please do not spam)