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?
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.
Thanks for sharing this, I always had a doubt on these two methods performance.
They actually implement different algorithms. Check javadocs.