Sorting Out Sorting

Université de Montréal, Montreal, Quebec: 16mm.
"Identifie, au moyen de graphiques entièrement conçus et animés par ordinateur, 9 techniques différentes de tri de données qui se groupent sous trois classes : le tri par insertion, le tri par échange et le tri par sélection."

Université du Québec à Montréal, Montreal, Quebec: 16mm, VHS.

Simon Fraser University, Vancouver, British Columbia: 16mm.
"This film compares 9 sorting algorithms. These algorithms are portrayed through computer animation combining the explanation of how they work with an imaginative demonstration of why they work."

University of Waterloo, Waterloo, Ontario: 16mm, VHS.
"This film presents nine sorting algorithms of three types—insertion sorts—linear, binary and shellsort, exchange sorts—bubblesort, shakersort, and quicksort, and selection shorts—straight, tree and heapsort. After each group of three is presented, there follows a set of three animated graphs comparing them for data comparisons, data movements and execution time. Following that is a 'race' of the three techniques. After all three groups have been presented, there is a race of all nine algorithms. N log n techniques prove to be far more efficient than the n squared techniques. As an epilogue, the entire film is presented again at 12 times the original speed."

University of Guelph, Guelph, Ontario: 16mm.

York University, Toronto, Ontario: 16mm, VHS.
"This is a film which uses computer animation exclusively to explain the available programs which computers use to sort information. The programs are broken into three groups: the insertion group, the exchange group, and the selection group. Each group is then broken down again into three examples. The insertion group includes linear insertion, binary insertion, and shell sort. The exchange group includes straight selection, tree selection, and heap sort."

University of Ottawa, Ottawa, Ontario: VHS.

Wilfrid Laurier University, Waterloo, Ontario: 16mm.