Sorting2.5 - Quick-Sort Running Time We can analyze the...

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Last Updated: 4/1/10 11:16 AM CSE 2011 Prof. J. Elder - 76 - Quick-Sort Running Time ± We can analyze the running time of Quick-Sort using a recursion tree. ± At depth i of the tree, the problem is partitioned into 2 i sub-problems. ± The running time will be determined by how balanced these partitions are. depth 0 1 h
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon