Sorting-Visualizer/SortingVisualizer.java at master · azar011/Sorting-Visualizer · GitHub

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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
packageVisualizer;

importjava.util.ArrayList;
importjava.util.Collections;

importVisualizer.Sorts.*;

publicclassSortingVisualizer {

privatestaticThreadsortingThread;

publicstaticVisualizerFrameframe;
publicstaticInteger[] toBeSorted;
publicstaticbooleanisSorting = false;
publicstaticintsortDataCount = 20;
publicstaticintsleep = 20;
publicstaticintblockWidth;
// Stepped depicts whether the values are incremental or random. True is incremental.
publicstaticbooleanstepped = false;

publicstaticvoidmain(String[] args) {
frame = newVisualizerFrame();
resetArray();
frame.setLocationRelativeTo(null);
 }

publicstaticvoidresetArray(){
// If we are currently in a sorting method, then isSorting should be true
// We do not want to reinitialize/reset the array mid sort.
if (isSorting) return;
toBeSorted = newInteger[sortDataCount];
blockWidth = (int) Math.max(Math.floor(500/sortDataCount), 1);
for(inti = 0; i<toBeSorted.length; i++){
if (stepped) {
toBeSorted[i] = i;
 } else {
toBeSorted[i] = (int) (sortDataCount*Math.random());
 }
 }
// If we're using incremental values, they are already sorted. This shuffles it.
if (stepped) {
ArrayList<Integer> shuffleThis = newArrayList<>();
for (inti = 0; i < toBeSorted.length; i++) {
shuffleThis.add(toBeSorted[i]);
 }
Collections.shuffle(shuffleThis);
toBeSorted = shuffleThis.toArray(toBeSorted);
 }
frame.preDrawArray(toBeSorted);
 }

publicstaticvoidstartSort(Stringtype){

if (sortingThread == null || !isSorting){

resetArray();

isSorting = true;

switch(type){
case"Bubble":
sortingThread = newThread(newBubbleSort(toBeSorted, frame, false));
break;

case"Selection":
sortingThread = newThread(newSelectionSort(toBeSorted, frame, false));
break;

case"Insertion":
sortingThread = newThread(newInsertionSort(toBeSorted, frame, false));
break;

case"Gnome":
sortingThread = newThread(newGnomeSort(toBeSorted, frame, false));
break;

case"Merge":
sortingThread = newThread(newMergeSort());
break;

case"Radix LSD":
sortingThread = newThread(newRadixSort(toBeSorted, frame, true));
break;

case"Radix MSD":
sortingThread = newThread(newRadixSort(toBeSorted, frame, false));
break;

case"Shell":
sortingThread = newThread(newShellSort());
break;

case"Quandrix":
sortingThread = newThread(newQuandrixSort());
break;

case"Bubble(fast)":
sortingThread = newThread(newBubbleSort(toBeSorted, frame, true));
break;

case"Selection(fast)":
sortingThread = newThread(newSelectionSort(toBeSorted, frame, true));
break;

case"Insertion(fast)":
sortingThread = newThread(newInsertionSort(toBeSorted, frame, true));
break;

case"Gnome(fast)":
sortingThread = newThread(newGnomeSort(toBeSorted, frame, true));
break;

default:
isSorting = false;
return;
 }

sortingThread.start();

 }

 }

}