|
164
|
1 package alice.test.codesegment.local.bitonicsort;
|
|
|
2
|
|
|
3 import java.util.ArrayList;
|
|
|
4 import java.util.List;
|
|
|
5 import java.util.Random;
|
|
|
6
|
|
|
7 public class SortTest {
|
|
|
8
|
|
|
9 public static void main(String args[]){
|
|
200
|
10 int size = 100000;
|
|
169
|
11 int MAX = 1024;
|
|
164
|
12 long t;
|
|
|
13 List<Integer> list = new ArrayList<Integer>();
|
|
|
14 List<Integer> list2 = new ArrayList<Integer>();
|
|
165
|
15 List<Integer> sorted;
|
|
164
|
16
|
|
|
17 for (int i = 0; i < size; i++){
|
|
|
18 Random rnd = new Random();
|
|
|
19 list.add(rnd.nextInt(MAX));
|
|
|
20 }
|
|
|
21 for (int i = 0; i < size; i++){
|
|
|
22 Random rnd = new Random();
|
|
165
|
23 list2.add(rnd.nextInt(MAX));
|
|
164
|
24 }
|
|
165
|
25
|
|
|
26 //recursive type quicksort
|
|
164
|
27 t = System.currentTimeMillis();
|
|
165
|
28 sorted = Sort.quickSort(list);
|
|
164
|
29 System.out.println("quick sort1 : "+ (System.currentTimeMillis()-t)+" ms");
|
|
165
|
30 Sort.check(sorted);
|
|
164
|
31
|
|
|
32 t = System.currentTimeMillis();
|
|
165
|
33 sorted = Sort.quickSort(list,list2);
|
|
164
|
34 System.out.println("quick sort2 : "+ (System.currentTimeMillis()-t)+" ms");
|
|
165
|
35 Sort.check(sorted);
|
|
|
36
|
|
|
37 // stack type quicksort
|
|
|
38 t = System.currentTimeMillis();
|
|
|
39 Sort.quickSort(list,0,list.size()-1);
|
|
|
40 System.out.println("quick sort3 : "+ (System.currentTimeMillis()-t)+" ms");
|
|
|
41 Sort.check(list);
|
|
164
|
42
|
|
|
43 t = System.currentTimeMillis();
|
|
166
|
44 Sort.bubbleSort(list2,0,list2.size()-1);
|
|
164
|
45 System.out.println("bubble sort : "+ (System.currentTimeMillis()-t)+" ms");
|
|
165
|
46 Sort.check(list2);
|
|
164
|
47 }
|
|
|
48 }
|
