Lower Bound Assumptions III

• The choice of which key is larger is the only point at which two “runs” of an algorithm can exhibit divergent behavior.

• Divergent behavior includes, rearranging the keys in two different ways.

Previous slide

Next slide

Back to first slide

View graphic version