package alice.test.codesegment.local.bitonicsort;

import java.util.ArrayList;
import java.util.List;
import java.util.Random;

public class SortTest {
	
	public static void main(String args[]){
		int size = 100000;
		int MAX = 1024;
		long t;
		List<Integer> list = new ArrayList<Integer>();
		List<Integer> list2 = new ArrayList<Integer>();
		List<Integer> sorted;
		
		for (int i = 0; i < size; i++){
			Random rnd = new Random();
			list.add(rnd.nextInt(MAX));
		}
		for (int i = 0; i < size; i++){
			Random rnd = new Random();
			list2.add(rnd.nextInt(MAX));
		}
		
		//recursive type quicksort
		t = System.currentTimeMillis();
		sorted = Sort.quickSort(list);
		System.out.println("quick sort1 : "+ (System.currentTimeMillis()-t)+" ms");
		Sort.check(sorted);
		
		t = System.currentTimeMillis();
		sorted = Sort.quickSort(list,list2);
		System.out.println("quick sort2 : "+ (System.currentTimeMillis()-t)+" ms");
		Sort.check(sorted);
		
		// stack type quicksort
		t = System.currentTimeMillis();
		Sort.quickSort(list,0,list.size()-1);
		System.out.println("quick sort3 : "+ (System.currentTimeMillis()-t)+" ms");
		Sort.check(list);
		
		t = System.currentTimeMillis();
		Sort.bubbleSort(list2,0,list2.size()-1);
		System.out.println("bubble sort : "+ (System.currentTimeMillis()-t)+" ms");
		Sort.check(list2);
	}
}