Course Level
Data Structures
Knowledge Unit
Fundamental Data Structures
Collection Item Type
Assignment
Synopsis
In this activity, students exercise their understanding of merge sort by implementing it in Java in the context of sorting an array of cards. Students use a built in Comparable interface to assist with the merge sort. This is a very focused activity testing students' understanding of a sorting algorithm.
Recommendations
For more information on how this homework fits within the scope of the course, please see the following course schedule and syllabus here: (http://mathcs.pugetsound.edu/~aasmith/cs261/). Search "Mergesort".
Engagement Highlights
By putting the sorting algorithm in the context of sorting cards, the activity has Meaningful and Relevant Context.
Engagement Practices Employed
Materials and Links
Computer Science Details
Programming Language
Java
Material Format and Licensing Information
Creative Commons License
CC BY-NC-SA