{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture10-quicksort

This preview shows pages 1–9. Sign up to view the full content.

CS 312: Algorithm Analysis Lecture #10: Analysis of Quicksort This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License. Slides by: Eric Ringger, with contributions from Mike Jones, Eric Mercer, Sean Warnick

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

View Full Document
Announcements § HW #7 Due Today § Questions about Non-homogeneous RR or Change-of-variable? § Project #2 § Early: today § Due: Monday
Starting a Career § Career Fair Preview § Wednesday, Feb. 1 § 5:00 p.m. § in 1170 TMCB § BYU Technical Career Fair § Thursday, Feb. 2 § 9 a.m. to 3 p.m. § Wilkinson Center Ballroom

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

View Full Document
Objectives § Answer your questions about RRs § Review theoretical analysis of Quicksort § Worst case § Best case § Empirical analysis of Quicksort § Prepare for average case analysis
Follow-up Questions: Recurrence Relations

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

View Full Document
Part III, Problem #3 (for fun)
Efficient Sorting

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

View Full Document
Quicksort § Quicksort sorts in place § Example: Pivot about first element (3) § 3 1 4 1 5 9 2 6 5 3 5 8 9 --- before § 2 1 3 1 3 9 5 6 5 4 5 8 9 --- after § At most n swaps § Pivot element ends up in it’s final position § No element left or right of pivot will flip sides again § Sort each side independently § Recursive Divide and Conquer approach
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}