-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTest.java
185 lines (157 loc) · 6.72 KB
/
Test.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
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
import java.util.Random;
import java.util.Arrays;
public class Test {
//args[] som stoerrelse på mengden tilfeldige tall
public static void main(String[] args){
int arr[];
double tid;
//ArrayConstructor generator = new ArrayConstructor();
Sortering sorteringsMann = new Sortering();
/*
testSelectionSort(sorteringsMann, 10);
testQuickSort(sorteringsMann, 10);
testHeapSort(sorteringsMann, 10);
*/
/* JavaSort
System.out.println("\nWARMUP");
testSelectionSort(sorteringsMann, 1000);
System.out.println("\n FULL TEST \n");
testJavaSort(sorteringsMann, 1000);
testJavaSort(sorteringsMann, 5000);
testJavaSort(sorteringsMann, 10000);
testJavaSort(sorteringsMann, 50000);
testJavaSort(sorteringsMann, 100000);
testJavaSort(sorteringsMann, 1000000); //1 million
testJavaSort(sorteringsMann, 100000000); //100 millioner
*/
/* SelectionSort
System.out.println("\nWARMUP");
testSelectionSort(sorteringsMann, 1000);
System.out.println("\n FULL TEST \n");
testSelectionSort(sorteringsMann, 1000);
testSelectionSort(sorteringsMann, 5000);
testSelectionSort(sorteringsMann, 10000);
testSelectionSort(sorteringsMann, 50000);
testSelectionSort(sorteringsMann, 100000);
testSelectionSort(sorteringsMann, 1000000); //1 million
testSelectionSort(sorteringsMann, 100000000); //100 millioner
*/
/* HeapSort
System.out.println("\nWARMUP");
System.out.println("\n FULL TEST \n");
testHeapSort(sorteringsMann, 1000);
testHeapSort(sorteringsMann, 1000);
testHeapSort(sorteringsMann, 5000);
testHeapSort(sorteringsMann, 10000);
testHeapSort(sorteringsMann, 50000);
testHeapSort(sorteringsMann, 100000);
testHeapSort(sorteringsMann, 1000000);
testHeapSort(sorteringsMann, 100000000);
*/
/* QuickSort
System.out.println("\nWARMUP");
testQuickSort(sorteringsMann, 1000);
System.out.println("\n FULL TEST \n");
testQuickSort(sorteringsMann, 1000);
testQuickSort(sorteringsMann, 5000);
testQuickSort(sorteringsMann, 10000);
testQuickSort(sorteringsMann, 50000);
testQuickSort(sorteringsMann, 100000);
testQuickSort(sorteringsMann, 1000000);
testQuickSort(sorteringsMann, 100000000);
*/
}//end main
public static boolean erStigende(int[] testet){
for (int i = 0; i < testet.length; i++){
}
return true;
}
public static void testJavaSort(Sortering sorter, int stoerrelse){
ArrayConstructor generator = new ArrayConstructor();
int[] arr;
double tid;
long t;
System.out.println("\n----JAVA SORT FOR " + stoerrelse + "----");
arr = generator.getRandArray(stoerrelse, stoerrelse);
t = System.nanoTime();
Arrays.sort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Tilfeldig sortert kjoretid: " + tid);
arr = generator.getIncreasingArray(stoerrelse);
t = System.nanoTime();
Arrays.sort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Stigende sortert kjoretid: " + tid);
arr = generator.getDecreasingArray(stoerrelse);
t = System.nanoTime();
Arrays.sort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Synkende sortert kjoretid: " + tid);
}
public static void testSelectionSort(Sortering sorter, int stoerrelse){
ArrayConstructor generator = new ArrayConstructor();
int[] arr;
double tid;
long t;
System.out.println("\n----SELECTION SORT FOR " + stoerrelse + "----");
arr = generator.getRandArray(stoerrelse, stoerrelse);
t = System.nanoTime();
sorter.selectionSort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Tilfeldig sortert kjoretid: " + tid);
arr = generator.getIncreasingArray(stoerrelse);
t = System.nanoTime();
sorter.selectionSort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Stigende sortert kjoretid: " + tid);
arr = generator.getDecreasingArray(stoerrelse);
t = System.nanoTime();
sorter.selectionSort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Synkende sortert kjoretid: " + tid);
}
public static void testHeapSort(Sortering sorter, int stoerrelse){
ArrayConstructor generator = new ArrayConstructor();
int[] arr;
double tid;
long t;
System.out.println("\n----HEAP-SORT FOR " + stoerrelse + "----");
arr = generator.getRandArray(stoerrelse, stoerrelse);
t = System.nanoTime();
sorter.heapSort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Tilfeldig sortert kjoretid: " + tid);
arr = generator.getIncreasingArray(stoerrelse);
t = System.nanoTime();
sorter.heapSort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Stigende sortert kjoretid: " + tid);
arr = generator.getDecreasingArray(stoerrelse);
t = System.nanoTime();
sorter.heapSort(arr);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Synkende sortert kjoretid: " + tid);
}
public static void testQuickSort(Sortering sorter, int stoerrelse){
ArrayConstructor generator = new ArrayConstructor();
int[] arr;
double tid;
long t;
System.out.println("\n----QUICK-SORT FOR " + stoerrelse + "----");
arr = generator.getRandArray(stoerrelse, stoerrelse);
t = System.nanoTime();
sorter.quickSort(arr, 0, arr.length-1);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Tilfeldig sortert kjoretid: " + tid);
arr = generator.getIncreasingArray(stoerrelse);
t = System.nanoTime();
sorter.quickSort(arr, 0, arr.length-1);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Stigende sortert kjoretid: " + tid);
arr = generator.getDecreasingArray(stoerrelse);
t = System.nanoTime();
sorter.quickSort(arr, 0, arr.length-1);
tid = ( System.nanoTime() - t ) / 1000000.0;
System.out.println("Synkende sortert kjoretid: " + tid);
}
}//end