opus:fall2012:bkrishe3:discretepart2
Table of Contents
discrete Keyword 2
cycle sort
Definition
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.
References
discrete Keyword 2 Phase 2
venn diagrams
Definition
A pictorial way to compare two things and also show what they have in common, often shown with two circles overlaying each other.
References
Demonstration
Demonstration of the indicated keyword.
opus/fall2012/bkrishe3/discretepart2.txt · Last modified: 2012/10/31 12:51 by bkrishe3