package alice.test.codesegment.local.bitonicsort;

import java.util.Random;

public class SortTest {

    public static void main(String args[]){
        int size1 = 1000000;
        int size2 = 1000;
        int MAX = 1000000;
        long t;
        DataList list1 = new DataList(size1);
        DataList list2 = new DataList(size1);
        DataList list3 = new DataList(size2);

        Random rnd = new Random();
        for (int i = 0; i < size1; i++){
            int num = rnd.nextInt(MAX)+10;
            list1.table[i] = num;
            list2.table[i] = num;
        }
        for (int i = 0; i < size2; i++){
            int num = rnd.nextInt(MAX)+10;
            list3.table[i] = num;
        }

        // bubbleSort
        t = System.currentTimeMillis();
        Sort.bubbleSort(list3,0,list3.table.length-1);
        System.out.println("bubble sort : "+ (System.currentTimeMillis()-t)+" ms");
        Sort.check(list3);

        // quickSort
        t = System.currentTimeMillis();
        Sort.quickSort(list1);
        System.out.println("quick sort1 : "+ (System.currentTimeMillis()-t)+" ms");
        Sort.check(list1);

        t = System.currentTimeMillis();
        Sort.quickSort(list2);
        System.out.println("quick sort2 : "+ (System.currentTimeMillis()-t)+" ms");
        Sort.check(list2);

        // merge Test
        DataList.merge(list1, list2);
        Sort.check(list1);
        Sort.check(list2);

        // separate Test
        list1.showData(50);
        list1.createDataList(0, 25).showSize();
        list1.createDataList(0, 25).showData();
        list1.createDataList(25, 25).showData();
    }
}