public static void main(String[] args) {
		
		algorithm = "insertion"; //Type of algorithm to use for sorting.
		
		
		
		if (args.length == 1) { //argument given, use this as algorithm
			if (args[0].equals("insertion") || args[0].equals("quick")) {
				algorithm = args[0];
			}else {
				return;
			}
		}
		
		System.out.println("Doubling ratio experiment: " + algorithm + " (sorted input:" + ordered + ")");
		System.out.println("Input size | running time | ratio curr/prev | #compares");
		double prev = timeTrial(125);
		for (int N = 250; N <= MAX; N += N) {
			double time = timeTrial(N);
			StdOut.printf("%8d %7.1f ", N, time);
			StdOut.printf("%5.1f ", time/prev);
			StdOut.printf("%-3d\n", compares);
			prev = time;
		}
		
	}