Original Author/link
CS2013 Knowledge Unit Coverage
N/A
TCPP Coverage
Algorithms:
- Know Sorting: Observe several sorting algorithms for varied platforms — together with analyses. Parallel merge sort is the simplest example, but equally simple alternatives for rings and meshes might be covered also; more sophisticated algorithms might be covered in more advanced courses (1 hour)
Recommended Courses
- K-12: CSUnplugged recommends this as a K-12 activity.
- CS1/CS2/DSA: The activity can be used to introduce students to parallel sorting concepts in undergraduate courses, but is inappropriate for large classes.
Accessibility
This exercise requires movement and visuals. For those who are mobility-impaired, the exercise can be done on paper instead, or through Second Life (Bell 2009). Disabled students experiencing the exercise in Second Life reported enjoying the activity (Manabe 2011).
Citations
-
T. Bell, J. Alexander, I. Freeman, and M. Grimley, “Computer science unplugged: School students doing real computing without computers”, The New Zealand Journal of Applied Computing and Information Technology, vol. 13, no. 1, pp. 20–29, 2009.
-
H. Manabe, S. Kanemune, M. Namiki, and Y. Nakano, “CS Unplugged assisted by digital materials for handicapped people at schools”, in International Conference on Informatics in Schools: Situation, Evolution, and Perspectives Springer, 2011, pp. 82–93.