In this activity, students exercise their understanding of heap sort by implementing it in Java in the context of sorting an array of cards and an array of integers. Students use a built in Comparable interface to assist with the heap sort. Students are also advised to use recursion in the Heapify subroutine found in heap sort. This is a very focused activity testing students' understanding of a sorting algorithm.