testsort.java

The running time of quicksort can be improved in practice by taking advantage of the fast running t

public class TestSort
{
	public static void main(String[] args) 
	{
		//Create 2 same arrays with 5 numbers at random.
		double[] sourceArrayForInsertionSort = new double[5];
		double[] sourceArrayForQuickSort = new double[5];
		for (int n = 0; n < sourceArrayForInsertionSort.length; n ++)
				sourceArrayForInsertionSort[n] = Math.random();
		for (int n = 0; n < sourceArrayForQuickSort.length; n ++)
				sourceArrayForQuickSort[n] = sourceArrayForInsertionSort[n];

		//Insertion sort.
		Sort insertionSort = new Sort(sourceArrayForInsertionSort);
		insertionSort.insertionSort(0, sourceArrayForInsertionSort.length - 1);
		System.out.println("The result of insertion sort is:");
		insertionSort.result();
		System.out.println("");

		//Quick sort
		Sort quickSort = new Sort(sourceArrayForQuickSort);
		quickSort.quickSort(0, sourceArrayForQuickSort.length - 1);
		System.out.println("The result of quick sort is:");
		quickSort.result();
	}
}