Merge Sort
General Idea
Time Complexity: O(n log n).
Empirical Analysis
n (in 1000s)
time (in milliseconds)
time / n log n
50
125
1.47
100
203
1.02
200
485
1.05
400
1000
0.96
800
1984
0.85
Class Code
MergeSort.java