forked from WWaldo/Sorting-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
MergeSort.java
91 lines (83 loc) · 2 KB
/
MergeSort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
import java.io.IOException;
import java.util.ArrayList;
public class MergeSort extends Sorts{
public ArrayList<Integer> mergeSort(ArrayList<Integer> unsortedList)
{
if(unsortedList.size() <= 1)
{
return unsortedList;
}
ArrayList<Integer> sortedList = new ArrayList<Integer>();
ArrayList<Integer> left = new ArrayList<Integer>();
ArrayList<Integer> right = new ArrayList<Integer>();
int middle = unsortedList.size()/2;
//Splits the array into unsortedList size lists of size one
for(int i = 0; i < unsortedList.size(); i++)
{
if(i < middle)
{
left.add(unsortedList.get(i));
}
else
{
right.add(unsortedList.get(i));
}
}
left = mergeSort(left);
right = mergeSort(right);
//combines the lists
sortedList = merge(left, right);
return sortedList;
}
public ArrayList<Integer> merge(ArrayList<Integer> left, ArrayList<Integer> right)
{
ArrayList<Integer> mergedList = new ArrayList<Integer>();
while(left.size() > 0 || right.size() > 0)
{
if(left.size() > 0 && right.size() > 0)
{
if(left.get(0) < right.get(0))
{
mergedList.add(left.get(0));
left.remove(0);
}
else
{
mergedList.add(right.get(0));
right.remove(0);
}
}
else if(left.size() > 0)
{
mergedList.add(left.get(0));
left.remove(0);
}
else if(right.size() > 0)
{
mergedList.add(right.get(0));
right.remove(0);
}
}
return mergedList;
}
public void MergeTime(IOClass ioStream) throws IOException
{
ioStream.readFromFile();
ArrayList<Integer> sortedList = new ArrayList<Integer>();
long timeBefore = System.nanoTime();
sortedList = mergeSort(ioStream.getInputArray());
long timeAfter = System.nanoTime();
double rawTime = timeAfter - timeBefore;
double timeInMilli = rawTime/1000000;
if(isSorted(sortedList))
{
ioStream.setInputArray(sortedList);
System.out.print("MergeSort time (in Milli): ");
System.out.println(timeInMilli);
}
else
{
System.out.println("Not sorted!");
}
}
}