Method mergeSort

src/main/java/cn/byhieg/algorithmtutorial/Sort.java:138–143 · view source on GitHub ↗

归并排序，将数组一分为二，对于每一子数组继续进行上述步骤，直到子数组只有1个元素，那么自然是有序的。然后不断合并两个数组，直到合并到整个数组。时间复杂度o(NlgN) 空间复杂度o(N) @param nums

(int[] nums)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

testMergeSortMethod · 0.80

realSortMethod · 0.95

testMergeSortMethod · 0.64