|
345
|
1 package alice.test.codesegment.local.bitonicsort;
|
|
|
2
|
|
|
3 import java.util.Random;
|
|
|
4
|
|
|
5 public class SortTest {
|
|
|
6
|
|
|
7 public static void main(String args[]){
|
|
|
8 int size1 = 1000000;
|
|
|
9 int size2 = 1000;
|
|
|
10 int MAX = 1000000;
|
|
|
11 long t;
|
|
|
12 DataList list1 = new DataList(size1);
|
|
|
13 DataList list2 = new DataList(size1);
|
|
|
14 DataList list3 = new DataList(size2);
|
|
|
15
|
|
|
16 Random rnd = new Random();
|
|
|
17 for (int i = 0; i < size1; i++){
|
|
|
18 int num = rnd.nextInt(MAX)+10;
|
|
|
19 list1.table[i] = num;
|
|
|
20 list2.table[i] = num;
|
|
|
21 }
|
|
|
22 for (int i = 0; i < size2; i++){
|
|
|
23 int num = rnd.nextInt(MAX)+10;
|
|
|
24 list3.table[i] = num;
|
|
|
25 }
|
|
|
26
|
|
|
27 // bubbleSort
|
|
|
28 t = System.currentTimeMillis();
|
|
|
29 Sort.bubbleSort(list3,0,list3.table.length-1);
|
|
|
30 System.out.println("bubble sort : "+ (System.currentTimeMillis()-t)+" ms");
|
|
|
31 Sort.check(list3);
|
|
|
32
|
|
|
33 // quickSort
|
|
|
34 t = System.currentTimeMillis();
|
|
|
35 Sort.quickSort(list1);
|
|
|
36 System.out.println("quick sort1 : "+ (System.currentTimeMillis()-t)+" ms");
|
|
|
37 Sort.check(list1);
|
|
|
38
|
|
|
39 t = System.currentTimeMillis();
|
|
|
40 Sort.quickSort(list2);
|
|
|
41 System.out.println("quick sort2 : "+ (System.currentTimeMillis()-t)+" ms");
|
|
|
42 Sort.check(list2);
|
|
|
43
|
|
|
44 // merge Test
|
|
|
45 DataList.merge(list1, list2);
|
|
|
46 Sort.check(list1);
|
|
|
47 Sort.check(list2);
|
|
|
48
|
|
|
49 // separate Test
|
|
|
50 list1.showData(50);
|
|
|
51 list1.createDataList(0, 25).showSize();
|
|
|
52 list1.createDataList(0, 25).showData();
|
|
|
53 list1.createDataList(25, 25).showData();
|
|
|
54 }
|
|
|
55 }
|
