In this activity, students exercise their understanding of quicksort by implementing it in Java in the context of sorting a deck of cards. Students use a built in Comparable interface to assist with the quicksort. Students are also given the option to give performance comparisons with heapsort and merge sort. This is a very focused activity testing students' understanding of a sorting algorithm.