Sorting Networks

To make computers go faster, it can be a lot more effective to have several slower computers working on a problem than a single fast one. This raises questions about how much of the computation can be done at the same time.

Here we use a fun team activity to demonstrate an approach to parallel sorting. It can be done on paper, but we like to get students to do it on a large scale, running from node to node in the network.

Activity description (PDF)



  • Photos from Computer Science camps for students aged 8-12, run by Mark Laprairie of the University of Regina.