mergesort and java implementation

Question

Suppose I want to use the mergesort algorithm. Does JAVA has a method/function which implements the mergesort algorithm?

Or do I have to "manually" code the algorithm?

I do not know JAVA at all.

Answer 1

是的，有Arrays.sort（Object []） ，OpenJDK有一个源代码示例

Answer 2

You could use Collections.sort()

The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n log(n) performance.

Answer 3

No there isn't a merge sort out of the box. A simple google after 'java mergesort' should give you plenty of useful results