Class Mergesort
java.lang.Object
topics.divideconquer.Mergesort
Mergesort algorithm using divide-and-conquer.
Orders n elements with O(n log n) time complexity in all cases.
Uses auxiliary arrays during merge, so extra space is O(n).
- Author:
- vicegd
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Mergesort
public Mergesort()
-
-
Method Details
-
mergesort
public void mergesort(int[] v) Sorts the input array using mergesort.- Parameters:
v- array to be sorted- Throws:
NullPointerException- if v is null
-