-
Notifications
You must be signed in to change notification settings - Fork 0
/
MergeSort.java
77 lines (54 loc) · 1.46 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
package Ajinkya.Sorts;
import Ajinkya.SortingVisualizer;
import Ajinkya.VisualizerFrame;
public class MergeSort implements Runnable{
private VisualizerFrame frame;
public void run() {
Integer[] toBeSorted = SortingVisualizer.toBeSorted;
inPlaceSort(toBeSorted);
SortingVisualizer.isSorting=false;
}
public void inPlaceSort ( Integer[] x )
{ inPlaceSort (x, 0, x.length-1);
}
private void inPlaceSort ( Integer[] x, int first, int last )
{
int mid, lt, rt;
int tmp;
if ( first >= last )
return;
mid = (first + last) / 2;
inPlaceSort (x, first, mid);
inPlaceSort (x, mid+1, last);
lt = first;
rt = mid+1;
if ( x[mid] <= x[rt]) //condition if already sorted
return;
while (lt <= mid && rt <= last)
{
if ( x[lt] <= x[rt]) //left select - no change
lt++;
else //right select - rotate
{
tmp = x[rt]; // move to lt
for (int i = rt-lt;i>0; i--)
{
x[lt+i] = x[lt+i-1];
}
x[lt] = tmp;
lt++;
mid++;
rt++; //moved everything up by one
}
SortingVisualizer.frame.reDrawArray(x, mid, rt, lt);
try
{
Thread.sleep(SortingVisualizer.sleep);
}
catch (InterruptedException e)
{
e.printStackTrace();
}
}
}
}