Lab46 Wiki

cycle sort

Cycle sort is an in-place, unstable sorting algorithm, a comparison sort that is theoretically optimal in terms of the total number of writes to the original array, unlike any other in-place sorting algorithm. It is based on the idea that the rearranging of things to be sorted can be factored into cycles, which can individually be rotated to give a sorted result.

• http://en.wikipedia.org/wiki/Cycle_sort
• http://en.wikipedia.org/wiki/Permutation

venn diagrams

A pictorial way to compare two things and also show what they have in common, often shown with two circles overlaying each other.

• http://www.purplemath.com/modules/venndiag.htm
• http://www.youtube.com/watch?v=Hek8Y3FlAm0

Demonstration of the indicated keyword.

http://www.purplemath.com/modules/venndiag.htm