Scores include penalties for handing in late

Correctness 35

	C1 Does not compile	-5
	C2 Does not sort correctly	-5
	C3 Finds the median of possible[] in pickPivot	-5
		(need to find median of Sortable[possible[]])
	C4 Sorts elements of Sortable[] in pickPivot	-5
	C5 Incorrect bounds when calling insertion sort	-5
	C6 Does not do shorter side first correctly in quicksort  -5
	C7 Does not use Sortable interface correctly -5

Style 11

	Sorter 5
	S1.1 pickPivot runs in O(n^3) time  -5

	Other 6
	S2.1 Lack of comments, illegible code, indentation etc. -2
	S2.2 Bad control structure -2
	S2.3 Unnecessary variables, statements, etc. -2

Extra credit 10

Report 54

	Experimental Procedures 10
	R1.1 Does not specify hardware and software used -2
	R1.2 Does not specify type of data used (Sortable OrderedInteger) -2
	R1.3 Does not mention the same array of numbers were used in all experiments -2
		for each array size
	R1.4 Does not state the time for each run is the average of 4 trials -2
	R1.5 Does not list the different parameter values used in testing -2

	Results 16
	R2.1 Does not show that quicksort matches the theoretical O(nlogn) running time. -4
		(need to prove from the data that the running time grows in O(nlogn) manner;
		 Not sufficient to say that the graph "looks" nlogn or x milliseconds is 
		 "approximately" nlogn.)
	R2.2 Does not discuss how each of the modifications affect the running time. -5
	R2.3 Does not discuss how combinations of improvements interact. -5
	R2.4 Did not consider combinations of medianOf and switchSize	-2
	     Or does not state the optimal medianOf supported by data	     
		(it is well established that when switching to insertion sort on
		 small subproblems, median of 3 is optimal.  Otherwise median of 1 is optimal)
	
	Conclusion & Summary 10
	R3.1 Does not interpret the data -5
	R3.2 Statement does not agree with data	-5

	Raw data 3
	R4.1 Columns not labeled/data not presentable -3

	General 10
	R5.1 Figures are not labeled	-3
	R5.2 Grammar, spelling (did you run the spell checker?)	-1
	R5.3 Bad graphing technique	-3
	R5.4 Uses the argument that n^2 is smaller than nlogn for small n	-3
		(n^2 is always larger than nlogn for n > 1.
		 It's the lower constant factor of insertion sort which makes it better
		 for small n than quicksort (e.g. 2 n^2 < 50 nlogn for n = 2))

	Presentation 5
	1 to 5 pts  For general formatting, effort, etc.
		See upper left corner of your assignment