Programming Project: Use data to classify Common Sorting Algorithms

Students learnign programming are often asked to understand the best, worst and average case of various common sorting algorithms such as Selection Sort, Insertion Sort, Merge Sort and others. This project requires students to figure out which sorting algiorithm is used based on the number of comparisons and swaps. The code for this is based off of David Levine's Sort Detective. I modified it slightly by obscuring some fields and self descriptive names that might let a student's prying eyes more easily figure out the answers to this project.

AB Class	A Class
download project AB Class	download project A Class
Sorts Selection Sort Insertion Sort Merge Sort Quick Sort	Sorts Selection Insertion Merge

Direcitons: Copy the .class adn .java files to your favorite editor. Make sure that you include the jpt.jar file in the build path. Compile and run RunSorter.java and start trying to figure out which algorithm is which.

Classify Common Sorting Algorithms based on data

Program Project for Java Students